A348444 -id:A348444 - cp's OEIS frontend

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

Graph
List
Refs
Listen
History
Text
Internal format

N. J. A. Sloane, Oct 16 2021

nonn

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

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

Cf. A307720, A307730, A348243.

A348444 is another version.

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Links

Crossrefs