A353971 -id:A353971 - cp's OEIS frontend

A353969 Lexicographically earliest sequence of distinct positive integers with no finite subset summing to a factorial number (A000142).

3, 4, 5, 7, 11, 18, 22, 23, 25, 26, 96, 103, 107, 114, 118, 158, 600, 696, 703, 707, 714, 718, 782, 4320, 4920, 5016, 5023, 5027, 5034, 5038, 5222, 35280, 39600, 40200, 40296, 40303, 40307, 40314, 40318, 41222, 322560, 357840, 362160, 362760, 362856, 362863

Offset: 1

Rémy Sigrist, May 12 2022

nonn

The sequence is well defined:
- a(1) = 3,
- for n > 0, let k be such that A000142(k) + 1 + a(1) + ... + a(n) < A000142(k+1),
- then a(n+1) <= A000142(k) + 1.

Rémy Sigrist, C++ program

See A353889 for similar sequences.

Cf. A000142, A353970, A353971.

A353970 a(n) is the number of ways to write n as a sum of distinct terms of A353969.

Original entry on oeis.org

1, 0, 0, 1, 1, 1, 0, 2, 1, 1, 1, 2, 2, 0, 2, 2, 2, 0, 3, 2, 1, 2, 3, 4, 0, 5, 5, 4, 3, 6, 8, 3, 6, 8, 8, 4, 7, 10, 7, 5, 8, 11, 5, 7, 10, 10, 6, 8, 14, 9, 8, 12, 15, 10, 10, 16, 15, 10, 13, 18, 14, 11, 14, 19, 12, 11, 17, 16, 11, 12, 18, 14, 10, 14, 18, 12, 11

Offset: 0

Rémy Sigrist, May 14 2022

nonn

a(0) = 1 accounts for the empty sum.

Rémy Sigrist, Table of n, a(n) for n = 0..10000
Rémy Sigrist, Scatterplot of the first 8! terms
Rémy Sigrist, C++ program

Cf. A353969, A353971 (positions of 0's).

cp's OEIS Frontend

A353969 Lexicographically earliest sequence of distinct positive integers with no finite subset summing to a factorial number (A000142).

Views

Author

Keywords

Comments

Links

Crossrefs