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 A294266 #13 Apr 16 2024 10:45:30
%S A294266 1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,2,0,0,0,0,
%T A294266 1,0,0,0,1,0,0,1,0,0,0,1,0,0,0,1,0,0,1,1,0,0,0,0,1,0,0,2,1,0,0,3,0,0,
%U A294266 0,1,1,0,0,1,3,0,0,2,2,0,0,1,0,1,0,2,1,1,0,3,1,0,0,2,3,0,0,1,1,0,1,2,1,1,0,2,2,0,0,3,4
%N A294266 Number of partitions of n into distinct squares that do not divide n.
%H A294266 Robert Israel, <a href="/A294266/b294266.txt">Table of n, a(n) for n = 0..10000</a>
%H A294266 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%H A294266 <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%e A294266 a(29) = 2 because we have [25, 4] and [16, 9, 4].
%p A294266 f:= proc(n) local P,k,x;
%p A294266 P:= 1;
%p A294266 for k from 2 to floor(sqrt(n)) do
%p A294266 if n mod k^2 = 0 then next fi;
%p A294266 P:= series(P*(1+x^(k^2)),x,n+1);
%p A294266 od;
%p A294266 coeff(P,x,n)
%p A294266 end proc:
%p A294266 map(f, [$0..200]); # _Robert Israel_, Apr 15 2024
%t A294266 Table[SeriesCoefficient[Product[1 + Boole[Mod[n, k] > 0 && OddQ[DivisorSigma[0, k]]] x^k, {k, 1, n}], {x, 0, n}], {n, 0, 110}]
%Y A294266 Cf. A033461, A200745, A284345, A294265, A371968.
%K A294266 nonn,look
%O A294266 0,30
%A A294266 _Ilya Gutkovskiy_, Oct 26 2017