GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — python-tutorial/learncopilot.py at master · vilasvarghese/python-tutorial

Expand file tree

/

learncopilot.py

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
26 lines (20 loc) · 701 Bytes
/

learncopilot.py

Copy path

File metadata and controls

26 lines (20 loc) · 701 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
#write me a code to calculate fibonnacci series using recursion
def fibonacci(n):
if n <= 1:
return n
else:
return fibonacci(n-1) + fibonacci(n-2)
n = int(input("Enter the number of terms: "))
if n <= 0:
print("Please enter a positive integer")
else:
print("Fibonacci sequence:")
for i in range(n):
print(fibonacci(i))
#Output
#Enter the number of terms: 10
#Fibonacci sequence:
#write documentation and comments for this
#code
#The Fibonacci sequence is a series of numbers in which each number is the sum of the two preceding ones, usually starting with 0 and 1.
#The Fibonacci sequence is defined by the recurrence relation:
You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.