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 A279281 #10 Feb 16 2025 08:33:37
%S A279281 1,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,1,1,0,0,0,
%T A279281 0,0,0,0,0,0,1,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,1,1,0,
%U A279281 0,1,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,1,1,1,1,0,0,0,0,0,0,1,2,1,0,0,0,0,0,0,1,1,0,0,1,1
%N A279281 Expansion of Product_{k>=1} (1 + x^(k*(3*k-2))).
%C A279281 Number of partitions of n into distinct octagonal numbers (A000567).
%H A279281 G. C. Greubel, <a href="/A279281/b279281.txt">Table of n, a(n) for n = 0..1000</a>
%H A279281 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/OctagonalNumber.html">Octagonal Number</a>
%H A279281 <a href="/index/Pol#polygonal_numbers">Index to sequences related to polygonal numbers</a>
%H A279281 <a href="/index/Par#partN">Index entries for related partition-counting sequences</a>
%F A279281 G.f.: Product_{k>=1} (1 + x^(k*(3*k-2))).
%e A279281 a(105) = 2 because we have [96, 8, 1] and [65, 40].
%t A279281 nmax = 120; CoefficientList[Series[Product[1 + x^(k (3 k - 2)), {k, 1, nmax}], {x, 0, nmax}], x]
%Y A279281 Cf. A000567, A024940, A033461, A218380, A279041, A279279, A279280.
%K A279281 nonn
%O A279281 0,106
%A A279281 _Ilya Gutkovskiy_, Dec 09 2016