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 A348245 #17 Oct 30 2021 03:37:54 %S A348245 1,1,2,1,2,3,1,1,2,3,4,2,3,4,5,6,1,2,3,4,5,6,7,8,9,1,1,2,3,4,5,6,7,8, %T A348245 2,3,4,5,6,7,8,9,10,11,12,1,1,2,3,4,5,1,2,3,4,5,6,7,1,1,2,3,4,5,6,7,8, %U A348245 9,10,2,3,4,5,6,7,8,9,10,11,12,13,14,1,2,3,4,5,6,7,8,9 %N A348245 If A307730(n) = i, then a(n) = 1 + number of copies of i that have already appeared in A307730. %C A348245 From the definition of A307720 and A307730, we know that any number i must eventually appear exactly i times in A307730. So a(n) <= A307730(n). %H A348245 N. J. A. Sloane, <a href="/A348245/b348245.txt">Table of n, a(n) for n = 1..10000</a> %H A348245 N. J. A. Sloane, <a href="/A348245/a348245.txt">Table of n, a(n) for n = 1..999999</a> %Y A348245 Cf. A307720, A307730, A348243. %Y A348245 A348444 is another version. %K A348245 nonn %O A348245 1,3 %A A348245 _N. J. A. Sloane_, Oct 16 2021