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 A353970 #11 Mar 24 2025 22:34:46 %S A353970 1,0,0,1,1,1,0,2,1,1,1,2,2,0,2,2,2,0,3,2,1,2,3,4,0,5,5,4,3,6,8,3,6,8, %T A353970 8,4,7,10,7,5,8,11,5,7,10,10,6,8,14,9,8,12,15,10,10,16,15,10,13,18,14, %U A353970 11,14,19,12,11,17,16,11,12,18,14,10,14,18,12,11 %N A353970 a(n) is the number of ways to write n as a sum of distinct terms of A353969. %C A353970 a(0) = 1 accounts for the empty sum. %H A353970 Rémy Sigrist, <a href="/A353970/b353970.txt">Table of n, a(n) for n = 0..10000</a> %H A353970 Rémy Sigrist, <a href="/A353970/a353970.png">Scatterplot of the first 8! terms</a> %H A353970 Rémy Sigrist, <a href="/A353970/a353970.txt">C++ program</a> %o A353970 (C++) // See Links section. %Y A353970 Cf. A353969, A353971 (positions of 0's). %K A353970 nonn %O A353970 0,8 %A A353970 _Rémy Sigrist_, May 14 2022