Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 May 18 2022 16:24:36
%S 1,0,0,0,1,0,1,0,0,0,2,0,1,0,1,0,2,0,1,1,1,0,2,1,0,2,1,0,1,3,0,2,1,1,
%T 0,4,0,2,0,2,1,4,0,1,2,2,1,3,1,0,3,2,1,1,3,0,3,1,2,1,3,0,4,1,1,2,4,0,
%U 2,3,1,2,4,1,1,4,2,2,2,2,1,5,1,1,3,3,0
%N a(n) is the number of ways to write n as a sum of distinct terms of A353966.
%C a(0) = 1 accounts for the empty sum.
%H Rémy Sigrist, <a href="/A353967/b353967.txt">Table of n, a(n) for n = 0..10000</a>
%H Rémy Sigrist, <a href="/A353967/a353967.txt">C++ program</a>
%o (C++) See Links section.
%Y Cf. A353966, A353968.
%K nonn
%O 0,11
%A _Rémy Sigrist_, May 14 2022