cp's OEIS Frontend

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

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