Fibonacci n-step number sequences: Difference between revisions
Content deleted Content added
Add table of values |
m at least the first ten members of each sequence. |
||
Line 38:
;The task is to:
# Write a function to generate Fibonacci n-step number sequences given its initial values and assuming the number of initial values determines how many previous values are summed to make the next number of the series.
# Use this to print and show here at least the first ten members of the Fibo/tribo/tetra-nacci and Lucas sequences.
;C.f:
| |||