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

1, 0, 0, 1, 0, 0, 1, 0, 0, 2, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 2, 0, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 0, 3, 1, 1, 2, 1, 1, 3, 0, 1, 2, 2, 2, 1, 2, 1, 1, 2, 1, 0, 4, 1, 2, 2, 0, 2, 2, 0, 2, 2, 1, 4, 0, 1, 2, 1, 1, 3, 1, 2, 3, 2, 1, 1, 3, 2, 3, 2, 3, 2, 3, 2, 2, 2, 4

Offset: 0

Author

Rémy Sigrist, May 11 2022

Keywords

• nonn

Comments

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

Examples

			The first terms, alongside the corresponding subsets of A353889, are:
  n   a(n)  Corresponding subsets
  --  ----  ---------------------
   0     1  {}
   1     0  none
   2     0  none
   3     1  {3}
   4     0  none
   5     0  none
   6     1  {6}
   7     0  none
   8     0  none
   9     2  {3, 6}, {9}
  10     0  none
  11     1  {11}
  12     1  {3, 9}
		

Links

• Rémy Sigrist, Table of n, a(n) for n = 0..10000
• Rémy Sigrist, Scatterplot of the first 2^18 terms
• Rémy Sigrist, C# program
• Rémy Sigrist, C++ program

Crossrefs

Cf. A353889, A353919 (positions of 0's).