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

%I #7 May 18 2022 16:24:49

%S 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,

%T 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,

%U 13,10,0,13,11,0,13,14,0,14,17,2,13,20,4,12

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

%C a(0) = 1 accounts for the empty sum.

%H Rémy Sigrist, <a href="/A353984/b353984.txt">Table of n, a(n) for n = 0..10000</a>

%H Rémy Sigrist, <a href="/A353984/a353984.png">Scatterplot of the first 16796 terms</a>

%H Rémy Sigrist, <a href="/A353984/a353984.txt">C++ program</a>

%o (C++) See Links section.

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

%K nonn

%O 0,10

%A _Rémy Sigrist_, May 14 2022