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 A307608 #5 Apr 18 2019 16:51:48
%S A307608 1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,
%T A307608 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
%U A307608 1,2,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1
%N A307608 Number of partitions of n^2 into consecutive positive squares.
%H A307608 <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%F A307608 a(n) = [x^(n^2)] Sum_{i>=1} Sum_{j>=i} Product_{k=i..j} x^(k^2).
%F A307608 a(n) = A296338(A000290(n)).
%F A307608 a(n) >= 2 for n in A097812.
%e A307608 29^2 = 20^2 + 21^2, so a(29) = 2.
%Y A307608 Cf. A000290, A030273, A034705, A037444, A097812, A151557, A296338.
%K A307608 nonn
%O A307608 1,5
%A A307608 _Ilya Gutkovskiy_, Apr 18 2019