This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A131234 #9 Jun 24 2022 19:57:30
%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,
%T A131234 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 A131234 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 A131234 Starts with 1, then n appears Fibonacci(n-1) times.
%C A131234 The largest nondecreasing 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 Cf. A130233.
%Y A131234 Partial sums of A010056.
%K A131234 nonn
%O A131234 1,2
%A A131234 _Tanya Khovanova_, Jun 20 2007