The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A006133 Related to representations as sums of Fibonacci numbers. (Formerly M3080) 0
 3, 21, 32, 79, 144, 155, 173, 202, 220, 231, 401, 524, 542, 553, 600, 922, 987, 998, 1016, 1045, 1063, 1074, 1121, 1139, 1150, 1168, 1186, 1197, 1215, 1244, 1367, 1385, 1396, 1443, 1508, 1519, 1537, 1566, 1584, 1595, 1765, 2608, 2731, 2749, 2760, 2807, 3129 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Common value of A003231(x) and A003234(x) for x in A006132 (see Table 1 p. 357 in Carlitz link). - Michel Marcus, Feb 02 2014 REFERENCES N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). LINKS L. Carlitz, R. Scoville and T. Vaughan, Some arithmetic functions related to Fibonacci numbers, Fib. Quart., 11 (1973), 337-386. FORMULA a(n) = A003231(A006132(n)) = A003234(A006132(n)). - Michel Marcus, Feb 02 2014 PROG (PARI) A001950(n) = floor(n*(sqrt(5)+3)/2); \\ b A003231(n) = floor(n*(sqrt(5)+5)/2); \\ c iss(n) = A003231(A001950(n)) == A001950(A003231(n)) - 1; lista(nn) = {v003231 = vector(nn, i, floor(i*(sqrt(5)+5)/2)); v003234 = select(n->iss(n), vector(5*nn, i, i)); for (n=1, nn, if (v003231[n] == v003234[n], print1(v003231[n], ", ")); ); }  \\ Michel Marcus, Feb 02 2014 CROSSREFS Sequence in context: A091103 A292310 A045802 * A317860 A039766 A072849 Adjacent sequences:  A006130 A006131 A006132 * A006134 A006135 A006136 KEYWORD nonn AUTHOR EXTENSIONS More terms from Michel Marcus, Feb 02 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 4 21:32 EDT 2021. Contains 346455 sequences. (Running on oeis4.)