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 A197122 #8 Jul 13 2013 12:04:17 %S A197122 1,1,2,2,4,4,7,7,11,12,17,18,26,28,37,40,53,57,74,79,101,109,136,145, %T A197122 181,195,237,255,308,332,397,427,506,546,641,688,807,868,1007,1081, %U A197122 1250,1342,1544,1655,1893,2033,2313,2477,2812,3015,3403,3644,4102,4390 %N A197122 Number of partitions of n into positive quarter-squares (cf. A002620). %H A197122 Reinhard Zumkeller, <a href="/A197122/b197122.txt">Table of n, a(n) for n = 0..100</a> %e A197122 a(10) = #{9+1, 6+4, 6+2+2, 6+2+1+1, 6+1+1+1+1, 4+4+2, 4+4+1+1, 4+2+2+2, 4+2+2+1+1, 4+2+1+1+1+1, 4+6x1, 2+2+2+2+2, 2+2+2+2+1+1, 2+2+2+1+1+1+1, 2+2+6x1, 2+8x1, 10x1} = 17. %o A197122 (Haskell) %o A197122 a197122 = p (drop 2 a002620_list) where %o A197122 p _ 0 = 1 %o A197122 p ks'@(k:ks) m | m < k = 0 %o A197122 | otherwise = p ks' (m - k) + p ks m %Y A197122 Cf. A197081, A002378, A000290, A000041. %K A197122 nonn %O A197122 0,3 %A A197122 _Reinhard Zumkeller_, Oct 10 2011