cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A106027 Smallest m > n such that the Zeckendorf partition of m contains that of n.

Original entry on oeis.org

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
Offset: 1

Views

Author

Reinhard Zumkeller, May 05 2005

Keywords

Comments

(A003714(a(n)) AND A003714(n)) = A003714(n);
A007895(a(n)) = A007895(n) + 1.

Examples

			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.