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 A294265 #5 Oct 26 2017 14:37:29
%S A294265 1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,1,1,0,0,2,1,0,0,3,1,1,0,3,
%T A294265 3,1,0,3,3,1,0,5,3,3,0,2,3,3,0,7,3,3,3,8,1,3,0,10,9,6,0,14,9,0,0,15,
%U A294265 12,9,4,15,16,9,0,18,18,7,1,23,18,17,0,9,22,19,5,30,28,19,5,34,6,24,2,40,36,30
%N A294265 Number of partitions of n into squares that do not divide n.
%H A294265 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%H A294265 <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%e A294265 a(25) = 2 because we have [16, 9] and [9, 4, 4, 4, 4].
%t A294265 Table[SeriesCoefficient[Product[1/(1 - Boole[Mod[n, k] > 0 && OddQ[DivisorSigma[0, k]]] x^k), {k, 1, n}], {x, 0, n}], {n, 0, 95}]
%Y A294265 Cf. A001156, A098743, A284345, A294266.
%K A294265 nonn
%O A294265 0,26
%A A294265 _Ilya Gutkovskiy_, Oct 26 2017