%I #12 May 18 2022 16:24:32
%S 1,0,0,1,0,0,1,0,0,2,0,1,1,0,1,1,0,1,1,1,2,0,1,1,1,1,1,1,2,1,2,1,0,3,
%T 1,1,2,1,1,3,0,1,2,2,2,1,2,1,1,2,1,0,4,1,2,2,0,2,2,0,2,2,1,4,0,1,2,1,
%U 1,3,1,2,3,2,1,1,3,2,3,2,3,2,3,2,2,2,4
%N a(n) is the number of ways to write n as a sum of distinct terms of A353889.
%C a(0) = 1 accounts for the empty sum.
%H Rémy Sigrist, <a href="/A353918/b353918.txt">Table of n, a(n) for n = 0..10000</a>
%H Rémy Sigrist, <a href="/A353918/a353918.png">Scatterplot of the first 2^18 terms</a>
%H Rémy Sigrist, <a href="/A353918/a353918.txt">C# program</a>
%H Rémy Sigrist, <a href="/A353918/a353918_1.txt">C++ program</a>
%e The first terms, alongside the corresponding subsets of A353889, are:
%e n a(n) Corresponding subsets
%e -- ---- ---------------------
%e 0 1 {}
%e 1 0 none
%e 2 0 none
%e 3 1 {3}
%e 4 0 none
%e 5 0 none
%e 6 1 {6}
%e 7 0 none
%e 8 0 none
%e 9 2 {3, 6}, {9}
%e 10 0 none
%e 11 1 {11}
%e 12 1 {3, 9}
%o (C#) See Links section.
%o (C++) See Links section.
%Y Cf. A353889, A353919 (positions of 0's).
%K nonn
%O 0,10
%A _Rémy Sigrist_, May 11 2022