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 A196880 #7 Mar 30 2012 17:37:35
%S A196880 1,1,4,10,36,94,284,692,1828,4124,9828,20798,45564,91018,186788,
%T A196880 355906,692004,1264678,2347716,4138358,7389572,12625938,21804900,
%U A196880 36243644,60777212,98547380,160987868,255297602,407492292,633469718,990388828,1512185428,2320518948
%N A196880 Number of partitions of n^2 into powers of 2.
%H A196880 Alois P. Heinz, <a href="/A196880/b196880.txt">Table of n, a(n) for n = 0..5000</a>
%F A196880 a(n) = [x^(n^2)] 1/Product_{j>=0}(1-x^(2^j)).
%e A196880 a(3) = 10, because there are 10 partitions of 3^2=9 into powers of 2: [1,8], [1,4,4], [1,2,2,4], [1,1,1,2,4], [1,1,1,1,1,4], [1,2,2,2,2], [1,1,1,2,2,2], [1,1,1,1,1,2,2], [1,1,1,1,1,1,1,2], [1,1,1,1,1,1,1,1,1].
%Y A196880 Column k=2 of A196879.
%K A196880 nonn
%O A196880 0,3
%A A196880 _Alois P. Heinz_, Oct 07 2011