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 A197081 #8 Jul 13 2013 12:04:17 %S A197081 1,1,1,1,1,1,2,2,1,2,2,2,3,3,2,3,4,3,4,4,4,5,6,5,4,6,6,7,7,7,7,9,10,8, %T A197081 9,9,11,12,12,11,11,13,15,16,13,15,16,17,20,19,17,20,23,20,22,23,23, %U A197081 27,29,26,25,30,31,32,34,33,32,38,41,37,39,41,42 %N A197081 Number of partitions of n into distinct positive quarter-squares (cf. A002620). %H A197081 Reinhard Zumkeller, <a href="/A197081/b197081.txt">Table of n, a(n) for n = 0..555</a> %e A197081 a(12) = #{12, 9+2+1, 6+4+2} = 3; %e A197081 a(24) = #{20+4, 16+6+2, 12+9+2+1, 12+6+4+2} = 4. %o A197081 (Haskell) %o A197081 a197081 = p (drop 2 a002620_list) where %o A197081 p _ 0 = 1 %o A197081 p (k:ks) m | m < k = 0 %o A197081 | otherwise = p ks (m - k) + p ks m %Y A197081 Cf. A197122, A002378, A000290, A000009. %K A197081 nonn %O A197081 0,7 %A A197081 _Reinhard Zumkeller_, Oct 10 2011