Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A107017
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A107017 Second largest term in Zeckendorf representation of n, a(n)=0 if n itself is a Fibonacci number. +0
3
0, 0, 0, 1, 0, 1, 2, 0, 1, 2, 3, 3, 0, 1, 2, 3, 3, 5, 5, 5, 0, 1, 2, 3, 3, 5, 5, 5, 8, 8, 8, 8, 8, 0, 1, 2, 3, 3, 5, 5, 5, 8, 8, 8, 8, 8, 13, 13, 13, 13, 13, 13, 13, 13, 0, 1, 2, 3, 3, 5, 5, 5, 8, 8, 8, 8, 8, 13, 13, 13, 13, 13, 13, 13, 13, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 0, 1, 2 (list; graph; listen)
OFFSET

1,7

COMMENT

a(A000045(n)) = 0;

a(A000045(n) + k) = A087172(k) with 0 < k < A000045(n-1).

LINKS

Eric Weisstein's World of Mathematics, Zeckendorf Representation

Eric Weisstein's World of Mathematics, Fibonacci Number

EXAMPLE

n = 20 = 13+5+2: a(20) = 5.

CROSSREFS

Cf. A007895.

Sequence in context: A049262 A145201 A119464 this_sequence A049260 A053186 A066628

Adjacent sequences: A107014 A107015 A107016 this_sequence A107018 A107019 A107020

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 09 2005

page 1

Search completed in 0.002 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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research