Fibonacci n-step number sequences: Difference between revisions

Content deleted Content added

Inline

@@ Line 33: / Line 33: @@
 Allied sequences can be generated where the initial values are changed:
-: '''The [[wp:Lucas number|Lucas series]]''' sums the two preceeding values like the fibonacci series for <math>n=2</math> but uses <math>[2, 1]</math> as its initial values.
+: '''The [[wp:Lucas number|Lucas series]]''' sums the two preceding values like the fibonacci series for <math>n=2</math> but uses <math>[2, 1]</math> as its initial values.
+<br>
-;The task is to:
+;Task:
 # Write a function to generate Fibonacci <math>n</math>-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.
-;Cf.:
+;Related tasks:
-* [[Fibonacci sequence]]
+* &nbsp; [[Fibonacci sequence]]
-* [http://mathworld.wolfram.com/Fibonaccin-StepNumber.html Wolfram Mathworld]
+* &nbsp; [http://mathworld.wolfram.com/Fibonaccin-StepNumber.html Wolfram Mathworld]
-* [[Hofstadter Q sequence‎]]
+* &nbsp; [[Hofstadter Q sequence‎]]
-* [https://www.youtube.com/watch?v=PeUbRXnbmms Lucas Numbers - Numberphile] (Video).
+* &nbsp; [https://www.youtube.com/watch?v=PeUbRXnbmms Lucas Numbers - Numberphile] (Video)
+<br><br>
 =={{header|Ada}}==