Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A106027
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A106027 Smallest m > n such that the Zeckendorf partition of m contains that of n. +0
2
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; listen)
OFFSET

1,1

COMMENT

(A003714(a(n)) AND A003714(n)) = A003714(n);

A007895(a(n)) = A007895(n) + 1.

LINKS

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: A094692 A059139 A110669 this_sequence A101159 A011518 A132265

Adjacent sequences: A106024 A106025 A106026 this_sequence A106028 A106029 A106030

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), May 05 2005

page 1

Search completed in 0.003 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research