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

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

Author

Rémy Sigrist, May 14 2022

Keywords

• nonn

Comments

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

Links

• 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

Crossrefs

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