A131234 Starts with 1, then n appears Fibonacci(n-1) times.

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

Offset: 1

Author

Tanya Khovanova, Jun 20 2007

Keywords

• nonn

Comments

The largest nondecreasing sequence a(n) such that a(Fibonacci(n-1)) = n.

Crossrefs

Cf. A072649 n occurs A000045(n) times.

Cf. A130233.

Partial sums of A010056.

Programs

Mathematica

Flatten[{1, Table[Table[n, {Fibonacci[n - 1]}], {n, 10}]}]