login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A131234 Starts with 1, then n appears Fibonacci(n-1) times. 1
1, 2, 3, 4, 4, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
The largest nondecreasing sequence a(n) such that a(Fibonacci(n-1)) = n.
LINKS
MATHEMATICA
Flatten[{1, Table[Table[n, {Fibonacci[n - 1]}], {n, 10}]}]
CROSSREFS
Cf. A072649 n occurs A000045(n) times.
Cf. A130233.
Partial sums of A010056.
Sequence in context: A030601 A049839 A130233 * A349983 A204924 A172006
KEYWORD
nonn
AUTHOR
Tanya Khovanova, Jun 20 2007
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 10:47 EDT 2024. Contains 371967 sequences. (Running on oeis4.)