|
%I #17 Oct 30 2021 03:37:54
%S 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 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 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 If A307730(n) = i, then a(n) = 1 + number of copies of i that have already appeared in A307730.
%C 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 N. J. A. Sloane, <a href="/A348245/b348245.txt">Table of n, a(n) for n = 1..10000</a>
%H N. J. A. Sloane, <a href="/A348245/a348245.txt">Table of n, a(n) for n = 1..999999</a>
%Y Cf. A307720, A307730, A348243.
%Y A348444 is another version.
%K nonn
%O 1,3
%A _N. J. A. Sloane_, Oct 16 2021
|
