login
A354006
a(n) is the number of ways to write n as a sum of distinct terms of A354005.
3
1, 0, 0, 1, 1, 0, 1, 2, 0, 1, 3, 2, 0, 3, 3, 1, 2, 5, 2, 1, 5, 5, 1, 3, 7, 2, 2, 7, 6, 0, 6, 8, 2, 3, 9, 5, 1, 8, 8, 2, 4, 11, 4, 2, 9, 9, 1, 6, 11, 3, 3, 11, 8, 0, 9, 10, 3, 4, 13, 5, 2, 11, 11, 2, 6, 14, 4, 4, 13, 11, 0, 11, 14, 4, 5, 16, 8, 2, 14, 14, 3, 7
OFFSET
0,8
COMMENTS
a(0) = 1 accounts for the empty sum.
LINKS
PROG
(C++) See Links section.
CROSSREFS
Sequence in context: A319284 A338526 A182703 * A307226 A263390 A231354
KEYWORD
nonn
AUTHOR
Rémy Sigrist, May 14 2022
STATUS
approved