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 A353984 #7 May 18 2022 16:24:49 %S A353984 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 A353984 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 A353984 13,10,0,13,11,0,13,14,0,14,17,2,13,20,4,12 %N A353984 a(n) is the number of ways to write n as a sum of distinct terms of A353983. %C A353984 a(0) = 1 accounts for the empty sum. %H A353984 Rémy Sigrist, <a href="/A353984/b353984.txt">Table of n, a(n) for n = 0..10000</a> %H A353984 Rémy Sigrist, <a href="/A353984/a353984.png">Scatterplot of the first 16796 terms</a> %H A353984 Rémy Sigrist, <a href="/A353984/a353984.txt">C++ program</a> %o A353984 (C++) See Links section. %Y A353984 Cf. A353983, A353985 (positions of 0's). %K A353984 nonn %O A353984 0,10 %A A353984 _Rémy Sigrist_, May 14 2022