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

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

Rémy Sigrist, Table of n, a(n) for n = 0..10000

Rémy Sigrist, Scatterplot of the first 2^20 terms

Rémy Sigrist, C++ program

Prog

(C++) See Links section.

Crossrefs

Cf. A354005, A354007.

Sequence in context: A319284 A338526 A182703 * A307226 A263390 A231354

Adjacent sequences: A354003 A354004 A354005 * A354007 A354008 A354009

Keyword

nonn

Author

Rémy Sigrist, May 14 2022

Status

approved