Pastebin
API
tools
faq
paste
Login
Sign up
SHARE
TWEET
recursive-fibonacci-generator-returns-list
farry
Mar 12th, 2024
807
0
Never
Add comment
Not a member of Pastebin yet?
Sign Up
, it unlocks many cool features!
Python
0.21 KB
| Source Code
|
0
0
raw
download
clone
embed
print
report
def
fibonacci
(
n
)
:
if
n
==
0
:
return
[
0
]
elif
n
==
1
:
return
[
0
,
1
]
else
:
f
=
fibonacci
(
n-
1
)
f.
append
(
f
[
-
1
]
+ f
[
-
2
]
)
return
f
print
(
fibonacci
(
16
)
)
Tags:
python
list
recursion
Fibonacci sequence
Advertisement
Add Comment
Please,
Sign In
to add comment
Public Pastes
✅ I earned $9000 with this method
5 min ago | 0.37 KB
Earn $$ on trading
CSS | 18 min ago | 0.37 KB
Crypto Exchange Profits
30 min ago | 0.37 KB
Free money using older build [1.3]
42 min ago | 0.37 KB
Changelly Exploit
CSS | 54 min ago | 0.37 KB
Basic port of Opera's tab traces for Viv...
JavaScript | 20 hours ago | 2.19 KB
How To Earn Crypto - Nov 2026 Guide
20 hours ago | 0.49 KB
Untitled
20 hours ago | 0.47 KB
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the
Cookies Policy
.
OK, I Understand
Not a member of Pastebin yet?
Sign Up
, it unlocks many cool features!