|
%I #9 Jun 24 2022 19:57:30
%S 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,
%T 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,
%U 10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10
%N Starts with 1, then n appears Fibonacci(n-1) times.
%C The largest nondecreasing sequence a(n) such that a(Fibonacci(n-1)) = n.
%t Flatten[{1, Table[Table[n, {Fibonacci[n - 1]}], {n, 10}]}]
%Y Cf. A072649 n occurs A000045(n) times.
%Y Cf. A130233.
%Y Partial sums of A010056.
%K nonn
%O 1,2
%A _Tanya Khovanova_, Jun 20 2007
|
