%I A131234
%S A131234 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,
%T A131234 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,
%U A131234 10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10
%N A131234 Starts with 1, then n appears Fibonacci(n-1) times.
%C A131234 The largest non-decreasing sequence a(n) such that a(Fibonacci(n-1)) 
               = n.
%t A131234 Flatten[{1, Table[Table[n, {Fibonacci[n - 1]}], {n, 10}]}]
%Y A131234 Cf. A072649 n occurs A000045(n) times.
%Y A131234 Sequence in context: A030601 A049839 A130233 this_sequence A056791 A027434 
               A071940
%Y A131234 Adjacent sequences: A131231 A131232 A131233 this_sequence A131235 A131236 
               A131237
%K A131234 nonn
%O A131234 1,2
%A A131234 Tanya Khovanova (tanyakh(AT)yahoo.com), Jun 20 2007