A030708 -id:A030708 - cp's OEIS frontend

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

Offset: 1

Clark Kimberling

nonn

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

Cf. A030708 (2nd list).

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

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.

Original entry on oeis.org

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

Clark Kimberling

nonn

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

The second list is A030758.

Cf. A030707, A030708, A030709.

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

A030709 Number of new terms at stage n in the formation of A030707.

Original entry on oeis.org

1, 1, 2, 3, 5, 6, 8, 9, 12, 15, 17, 18, 22, 24, 27, 30, 34, 36, 39, 42, 46, 48, 52, 57, 61, 65, 68, 71, 73, 77, 81, 84, 88, 92, 95, 99, 105, 108, 111, 114, 119, 124, 126, 130, 136, 142, 147, 150, 155, 158, 164, 167, 175, 180, 185, 189, 193, 197, 202, 207, 211

Offset: 1

Clark Kimberling

nonn

Also the number of new terms at stage n in the formation of A030757.

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

Cf. A030707, A030708, A030757, A030758.

More terms from Sean A. Irvine, Apr 06 2020

A030758 The second 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.

Original entry on oeis.org

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

Offset: 1

Clark Kimberling

nonn

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

The first list is A030757.

Cf. A030707, A030708, A030709.

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

cp's OEIS Frontend

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.

Views

Author

Keywords

Links

Crossrefs

Extensions

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.

Views

Author

Keywords

Links

Crossrefs

Extensions

A030709 Number of new terms at stage n in the formation of A030707.

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions

A030758 The second 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.

Views

Author

Keywords

Links

Crossrefs

Extensions