OFFSET
1,2
COMMENTS
Note that an n-Fibonacci sequence contains the numbers 2^k numbers for k<n. We also get 2^n-1, 2^(n+1)-3, 2^(n+2)-8, ... The sequence -1, -3, -8, continues following A001792 (for n large)...
Noe and Post conjectured that the only positive terms that are common to any two distinct n-step Fibonacci sequences are the powers of 2 that begin each sequence and 13 (in 2- and 3-step) and 504 (in 3- and 7-step). Perhaps we should also include 8 (in 2- and 4-step). - T. D. Noe, Dec 05 2006
LINKS
T. D. Noe, Table of n, a(n) for n=1..1000
Tony D. Noe and Jonathan Vos Post, Primes in Fibonacci n-step and Lucas n-step Sequences, J. of Integer Sequences, Vol. 8 (2005), Article 05.4.4.
MATHEMATICA
NFib25[nfb_] := Transpose[NestList[Join[Drop[ #, {1}], {Plus @@ #}] &, Map[If[ # == nfb, 1, 0] &, Range[nfb]], 25]][[ -1]]; Union[Flatten[Map[NFib25, Range[2, 20]]]][[Range[100]]]
NFib[nfb_, lim_] := Module[{f = 2^Range[0, nfb - 1]}, While[f[[-1]] <= lim, AppendTo[f, Total[Take[f, -nfb]]]]; Most[f]]; lim = 12; Union[Flatten[Table[NFib[i, 2^lim], {i, 2, lim + 1}]]] (* T. D. Noe, Oct 25 2013 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Carlos Alves, Dec 03 2006
EXTENSIONS
Edited by N. J. A. Sloane, Dec 15 2006
STATUS
approved