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 A348444 #11 Oct 21 2021 13:40:40 %S A348444 1,1,1,1,1,2,1,1,1,1,1,2,1,2,2,1,1,1,1,1,2,1,1,2,1,2,1,1,1,1,1,1,1,1, %T A348444 1,2,1,2,2,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,2,2,2,1,1,1,1,2,1,2,1,1,1, %U A348444 1,1,1,2,1,2,1,1,1,2,1,1,1,1,1,1,2,2,2,1,1,2,2,1,1,1,1,1,1,1,2,1,1,1 %N A348444 If A348243(n) = i, then a(n) = 1 + number of copies of i that have already appeared in A348243. %C A348444 In other words, when we see i in A348243, which i is it? The first, second, third, ...? This gives a measure of how many attempts we have to make in A307730 and A349243 before all the n instances of n have been obtained. %C A348444 The first 3's appear at n = 259, 490, 585, 627, ..., the first 4's at 3161, 4230, 5989, 8207, ... %C A348444 Note that A348409 gives the index of the last occurrence of each k in A307730. So until we reach A348409(k), we will not know how many attempts are needed to obtain all copies of k. %H A348444 N. J. A. Sloane, <a href="/A348444/b348444.txt">Table of n, a(n) for n = 1..750</a> %Y A348444 Cf. A307720, A307730, A348245, A348409. %K A348444 nonn %O A348444 1,6 %A A348444 _N. J. A. Sloane_, Oct 21 2021