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

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

Offset

0,11

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, C++ program

Prog

(C++) See Links section.

Crossrefs

Cf. A353966, A353968.

Sequence in context: A178112 A324852 A363854 * A035169 A340728 A275851

Adjacent sequences: A353964 A353965 A353966 * A353968 A353969 A353970

Keyword

nonn

Author

Rémy Sigrist, May 14 2022

Status

approved