This site is supported by donations to The OEIS Foundation.

 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. Sequence in context: A030601 A049839 A130233 * A204924 A172006 A172005 Adjacent sequences:  A131231 A131232 A131233 * A131235 A131236 A131237 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 25 08:15 EDT 2019. Contains 321469 sequences. (Running on oeis4.)