A030707 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A030707

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 ascending order to the second list and add the corresponding frequencies of those values to the first list.

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

LINKS

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

Sean A. Irvine, Java program (github)

CROSSREFS

Cf. A030708 (2nd list).

Sequence in context: A342915 A276433 A343226 * A349629 A254525 A132179

Adjacent sequences: A030704 A030705 A030706 * A030708 A030709 A030710

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

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

STATUS

approved