A353981 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A353981

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

3

1, 0, 0, 1, 1, 1, 0, 2, 2, 2, 1, 2, 4, 2, 2, 3, 4, 3, 2, 3, 4, 3, 2, 2, 5, 2, 1, 3, 4, 4, 0, 5, 6, 5, 3, 6, 12, 7, 7, 11, 15, 13, 9, 16, 19, 16, 13, 16, 22, 16, 13, 16, 20, 17, 9, 15, 18, 14, 9, 12, 21, 13, 10, 16, 23, 20, 13, 25, 31, 27, 23, 31, 42, 34, 31

(list; graph; refs; listen; history; text; internal format)

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*3*5*7*1*13 terms

Rémy Sigrist, C++ program

PROG

(C++) See Links section.

CROSSREFS

Cf. A353980, A353982 (positions of 0's).

Sequence in context: A331248 A361913 A253196 * A377289 A271205 A303841

Adjacent sequences: A353978 A353979 A353980 * A353982 A353983 A353984

KEYWORD

nonn

AUTHOR

Rémy Sigrist, May 14 2022

STATUS

approved