A353984 - OEIS

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

A353984

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

3

1, 0, 0, 1, 1, 0, 1, 1, 0, 2, 1, 0, 2, 3, 0, 2, 3, 1, 2, 3, 1, 2, 4, 1, 1, 4, 2, 1, 4, 2, 1, 5, 3, 0, 6, 4, 0, 5, 5, 0, 6, 6, 0, 7, 8, 1, 6, 10, 2, 6, 10, 3, 5, 11, 4, 4, 11, 5, 3, 12, 6, 2, 13, 8, 1, 13, 10, 0, 13, 11, 0, 13, 14, 0, 14, 17, 2, 13, 20, 4, 12

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

OFFSET

0,10

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 16796 terms

Rémy Sigrist, C++ program

PROG

(C++) See Links section.

CROSSREFS

Cf. A353983, A353985 (positions of 0's).

Sequence in context: A144219 A144027 A019591 * A341237 A091967 A031135

Adjacent sequences: A353981 A353982 A353983 * A353985 A353986 A353987

KEYWORD

nonn

AUTHOR

Rémy Sigrist, May 14 2022

STATUS

approved