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 A118653 #5 Mar 30 2012 18:40:37 %S A118653 1,1,2,3,2,4,3,4,3,3,3,3,3,2,4,3,4,3,3,2,3,3,3,4,4,3,3,3,3,3,3,3,3,4, %T A118653 3,3,2,3,4,3,3,4,3,3,4,3,3,3,3,3,3,4,3,3,3,3,4,3,3,3,3,3,4,3,3,3,2,2, %U A118653 4,2,3,3,4,3,4,3,3,4,3,2,4,4,4,3,3,2,3,3,3,2,2,4,4,3,3,3,3,3,3,3,3 %N A118653 Least number of squares that add up to the partition number A000041(n). %F A118653 a(n) = A002828(A000041(n)). %e A118653 a(20) = 3 because P(20) = 627 = 25^2 + 1^2 + 1^2. %e A118653 a(36) = 2 because P(36) = 17977 = 124^2 + 51^2, which is prime. %e A118653 a(66) = 2 because P(66) = 2323520 = 1504^2 + 248^2. %e A118653 a(67) = 2 because P(67) = 2679689 = 1205^2 + 1108^2. %e A118653 a(100) = 3 because P(100) = 190569292 = 13730^2 + 1434^2 + 6^2. %Y A118653 Cf. A000009, A000041, A000203, A008284, A002828, A001318, A046063, A103266, A118487. %K A118653 easy,nonn %O A118653 0,3 %A A118653 _Jonathan Vos Post_, May 17 2006