Talk:Fibonacci n-step number sequences: Difference between revisions

← Older edit

Talk:Fibonacci n-step number sequences (view source)

Revision as of 17:58, 28 April 2013

973 bytes added , 11 years ago

→‎Racket function fib-n?: Thanks.

Anonymous user

rosettacode>Paddy3118

Revision as of 03:08, 26 May 2012 (view source) rosettacode>Paddy3118 (→‎task clarification: Answered.) ← Older edit		Latest revision as of 17:58, 28 April 2013 (view source) rosettacode>Paddy3118 (→‎Racket function fib-n?: Thanks.)
(4 intermediate revisions by 3 users not shown)
Line 5: ::Ta! --[[User:Paddy3118\|Paddy3118]] 18:48, 25 May 2012 (UTC) ==~~octonacci~~Naming ~~vs.~~of ~~octanacci~~sequences== ===octonacci vs. octanacci=== (spelling). The term '''octonacci''' seems to be a misspelling. It should be '''octanacci'''. The misspelling in the OEIS database entry A104415 is (most likely) being changed as I typeth (as it was just edited for correction by me). -- [[User:Gerard Schildberger\|Gerard Schildberger]] 17:20, 25 May 2012 (UTC) Line 19 ⟶ 20: :::::Yay! I get a kick when I have a paw in something getting fixed at a site like OEIS. --[[User:Paddy3118\|Paddy3118]] 19:26, 25 May 2012 (UTC) ===undecanacci numbers== = this is the name of Fibonacci 11-step numbers. -- [[User:Gerard Schildberger\|Gerard Schildberger]] 17:20, 25 May 2012 (UTC) ===dodecanacci numbers== = this is the name of Fibonacci 12-step numbers. -- [[User:Gerard Schildberger\|Gerard Schildberger]] 17:20, 25 May 2012 (UTC) Line 45 ⟶ 46: Looking at the other sequences here, the 0 also works. For n = 3, [0, 1, 1] produces the same sequence (with the additional 0 at the beginning). For n = 4, [0, 1, 1, 2] produces the same sequence, and so on. --[[User:Spoon!\|Spoon!]] 01:38, 26 May 2012 (UTC) :This [http://www.math-cs.ucmo.edu/~curtisc/articles/howardcooper/genfib4.pdf reference, (pdf)] gives the zero too but I had found the was I reported earlier and just stuck with it. If you were to just make a note of the change in 'base' at the head of any example using this alternative then it should not be a problem. --[[User:Paddy3118\|Paddy3118]] 03:21, 26 May 2012 (UTC) ==Racket function fib-n? == Hi Soegaard, the Racket function <code>fib-n</code> does not fit the task description (part 1); although <code>fib-list</code> does. Unfortunately you seem to have used <code>fib-n</code> for some of the output which means that with only a slight change you can make it fit the task description. --[[User:Paddy3118\|Paddy3118]] ([[User talk:Paddy3118\|talk]]) 15:21, 28 April 2013 (UTC) :Hi Paddy, :I changed the test to display the whole table. Ta! --[[User:Paddy3118\|Paddy3118]] ([[User talk:Paddy3118\|talk]]) 17:58, 28 April 2013 (UTC)