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 A116905 #5 Mar 30 2012 18:40:36 %S A116905 1,0,1,1,0,0,0,0,0,1,2,1,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,1,0,2,2,0,0,1, %T A116905 1,0,1,0,2,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,1 %N A116905 Number of partitions of n-th 3-almost prime into 2 squares. %C A116905 See also A000161 Number of partitions of n into 2 squares (when order does not matter and zero is allowed). %F A116905 a(n) = A000161(A014612(n)). %e A116905 a(1) = 1 because A014612(1) = 8 = 2^2 + 2^2, the unique sum of squares. %e A116905 a(2) = 0 because A014612(2) = 12 has no decomposition into sum of 2 squares because it has a prime factor p == 3 (mod 4) with an odd power. %e A116905 a(11) = 2 because A014612(11) = 50 = 2*5^2 = 1^2 + 7^2 = 5^2 + 5^2. %e A116905 a(30) = 2 because A014612(30) = 125 = 5^3 = 2^2 + 11^2 = 5^2 + 1^0. %e A116905 a(31) = 2 because A014612(31) = 130 = 2*5*13 = 3^2 + 11^2 = 7^2 + 9^2. %e A116905 a(39) = 2 because A014612(39) = 170 = 2*5*17 = 1^2 + 13^2 = 7^2 + 11^2. %Y A116905 Cf. A000161, A014612. %K A116905 easy,nonn %O A116905 1,11 %A A116905 _Jonathan Vos Post_, Mar 15 2006