A348245 If A307730(n) = i, then a(n) = 1 + number of copies of i that have already appeared in A307730.

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, 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, 9, 10, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 1, 2, 3, 4, 5, 6, 7, 8, 9

Offset

1,3

Comments

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).

Links

N. J. A. Sloane, Table of n, a(n) for n = 1..10000

N. J. A. Sloane, Table of n, a(n) for n = 1..999999

Crossrefs

Cf. A307720, A307730, A348243.

A348444 is another version.

Sequence in context: A181631 A348390 A133674 * A215026 A162319 A237594

Adjacent sequences: A348242 A348243 A348244 * A348246 A348247 A348248

Keyword

nonn

Author

N. J. A. Sloane, Oct 16 2021

Status

approved