login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130312 Each Fibonacci number F(n) appears F(n) times. 0
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; refs; listen; history; internal format)
OFFSET

1,3

CROSSREFS

Cf. A000045

Sequence in context: A165079 A175944 A063905 * A076272 A180101 A108035

Adjacent sequences:  A130309 A130310 A130311 * A130313 A130314 A130315

KEYWORD

nonn

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 16:21 EST 2012. Contains 205823 sequences.