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 A353967 #7 May 18 2022 16:24:36 %S A353967 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 A353967 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 A353967 2,3,1,2,4,1,1,4,2,2,2,2,1,5,1,1,3,3,0 %N A353967 a(n) is the number of ways to write n as a sum of distinct terms of A353966. %C A353967 a(0) = 1 accounts for the empty sum. %H A353967 Rémy Sigrist, <a href="/A353967/b353967.txt">Table of n, a(n) for n = 0..10000</a> %H A353967 Rémy Sigrist, <a href="/A353967/a353967.txt">C++ program</a> %o A353967 (C++) See Links section. %Y A353967 Cf. A353966, A353968. %K A353967 nonn %O A353967 0,11 %A A353967 _Rémy Sigrist_, May 14 2022