The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A106027 Smallest m > n such that the Zeckendorf partition of m contains that of n. 1
 4, 7, 4, 12, 6, 19, 20, 9, 12, 31, 12, 33, 14, 17, 20, 17, 51, 19, 53, 54, 22, 25, 28, 25, 33, 27, 82, 83, 30, 33, 86, 33, 88, 35, 38, 41, 38, 46, 40, 53, 54, 43, 46, 133, 46, 135, 48, 51, 54, 51, 140, 53, 142, 143, 56, 59, 62, 59, 67, 61, 74, 75, 64, 67, 86, 67, 88, 69, 72, 75 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS (A003714(a(n)) AND A003714(n)) = A003714(n); A007895(a(n)) = A007895(n) + 1. LINKS Table of n, a(n) for n=1..70. Eric Weisstein's World of Mathematics, Zeckendorf Representation EXAMPLE 25 = 1+3+21 = Fib(2)+Fib(4)+Fib(8) with Fib=A000045, a(25) = 33 = 1+3+8+21 = Fib(2)+Fib(4)+Fib(6)+Fib(8); CROSSREFS Cf. A000045. Sequence in context: A059139 A329740 A110669 * A101159 A339948 A270136 Adjacent sequences: A106024 A106025 A106026 * A106028 A106029 A106030 KEYWORD nonn AUTHOR Reinhard Zumkeller, May 05 2005 STATUS approved

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

Last modified December 7 03:04 EST 2023. Contains 367622 sequences. (Running on oeis4.)