# Fibonacci

Generates a list, containing the Fibonacci sequence, up until the nth term.

• Starting with 0 and 1, use list.append() to add the sum of the last two numbers of the list to the end of the list, until the length of the list reaches n.
• If n is less or equal to 0, return a list containing 0.
def fibonacci(n):
if n <= 0:
return [0]
sequence = [0, 1]
while len(sequence) <= n:
next_value = sequence[len(sequence) - 1] + sequence[len(sequence) - 2]
sequence.append(next_value)
return sequence

fibonacci(7) # [0, 1, 1, 2, 3, 5, 8, 13]

## More like this

• Collection · 100 snippets

### Python Lists

A snippet collection of list helpers and tips for Python 3.6.

• Python ·

### Geometric progression

Initializes a list containing the numbers in the specified geometric progression range.

• Python ·

### Arithmetic progression

Generates a list of numbers in the arithmetic progression starting with the given positive integer and up to the specified limit.

• Python ·

### Digitize number

Converts a number to a list of digits.

Start typing a keyphrase to see matching snippets.