A030757 The first list after the following procedure: starting with a list [1] and an empty list, repeatedly add the distinct values already in both lists in descending order to the second list and add the corresponding frequencies of those values to the first list.

1, 1, 3, 1, 4, 1, 2, 6, 1, 2, 3, 1, 8, 1, 2, 3, 5, 3, 11, 1, 2, 3, 1, 4, 8, 5, 13, 1, 2, 4, 4, 3, 6, 10, 7, 16, 1, 2, 3, 1, 5, 1, 6, 4, 9, 12, 9, 18, 1, 2, 3, 1, 4, 2, 2, 6, 2, 8, 6, 11, 14, 11, 22, 1, 2, 3, 1, 4, 2, 7, 3, 3, 8, 3, 11, 7, 13, 16, 16, 25, 1, 2, 3

Offset

1,3

Links

Sean A. Irvine, Table of n, a(n) for n = 1..1000

Sean A. Irvine, Java program (github)

Crossrefs

The second list is A030758.

Cf. A030707, A030708, A030709.

Sequence in context: A346562 A230767 A324116 * A004592 A116992 A233267

Adjacent sequences: A030754 A030755 A030756 * A030758 A030759 A030760

Keyword

nonn

Author

Clark Kimberling

Extensions

Name revised in line with A030777 by Peter Munn, Oct 08 2022

Status

approved