Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130312
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130312 Each Fibonacci number F(n) appears F(n) times. +0
1
1, 1, 2, 2, 3, 3, 3, 5, 5, 5, 5, 5, 8, 8, 8, 8, 8, 8, 8, 8, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13 (list; graph; listen)
OFFSET

1,3

CROSSREFS

Cf. A000045

Sequence in context: A087826 A131624 A063905 this_sequence A076272 A108035 A049747

Adjacent sequences: A130309 A130310 A130311 this_sequence A130313 A130314 A130315

KEYWORD

nonn

AUTHOR

Edwin F. Sampang (efs_files(AT)yahoo.com), May 21 2007

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research