This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A354006 #8 May 18 2022 16:24:54 %S A354006 1,0,0,1,1,0,1,2,0,1,3,2,0,3,3,1,2,5,2,1,5,5,1,3,7,2,2,7,6,0,6,8,2,3, %T A354006 9,5,1,8,8,2,4,11,4,2,9,9,1,6,11,3,3,11,8,0,9,10,3,4,13,5,2,11,11,2,6, %U A354006 14,4,4,13,11,0,11,14,4,5,16,8,2,14,14,3,7 %N A354006 a(n) is the number of ways to write n as a sum of distinct terms of A354005. %C A354006 a(0) = 1 accounts for the empty sum. %H A354006 Rémy Sigrist, <a href="/A354006/b354006.txt">Table of n, a(n) for n = 0..10000</a> %H A354006 Rémy Sigrist, <a href="/A354006/a354006.png">Scatterplot of the first 2^20 terms</a> %H A354006 Rémy Sigrist, <a href="/A354006/a354006.txt">C++ program</a> %o A354006 (C++) See Links section. %Y A354006 Cf. A354005, A354007. %K A354006 nonn %O A354006 0,8 %A A354006 _Rémy Sigrist_, May 14 2022