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 A181322 #42 Feb 19 2019 13:02:28
%S A181322 1,1,1,1,2,1,1,2,3,1,1,2,4,4,1,1,2,4,6,5,1,1,2,4,6,9,6,1,1,2,4,6,10,
%T A181322 12,7,1,1,2,4,6,10,14,16,8,1,1,2,4,6,10,14,20,20,9,1,1,2,4,6,10,14,20,
%U A181322 26,25,10,1,1,2,4,6,10,14,20,26,35,30,11,1,1,2,4,6,10,14,20,26,36,44,36,12,1,1,2,4,6,10,14,20,26,36,46,56,42,13,1
%N A181322 Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) is the number of partitions of 2*n into powers of 2 less than or equal to 2^k.
%C A181322 Column sequences converge towards A000123.
%H A181322 Alois P. Heinz, <a href="/A181322/b181322.txt">Antidiagonals n = 0..140, flattened</a>
%H A181322 G. Blom and C.-E. Froeberg, <a href="/A002575/a002575.pdf">Om myntvaexling (On money-changing) [Swedish]</a>, Nordisk Matematisk Tidskrift, 10 (1962), 55-69, 103. [Annotated scanned copy] See Table 4.
%F A181322 G.f. of column k: 1/(1-x) * 1/Product_{j=0..k-1} (1 - x^(2^j)).
%F A181322 A(n,k) = Sum_{i=0..k} A089177(n,i).
%F A181322 For n < 2^k, T(n,k) = A000123(k). T(n,0) = 1, T(n,1) = n+1. - _M. F. Hasler_, Feb 19 2019
%e A181322 A(3,2) = 6, because there are 6 partitions of 2*3=6 into powers of 2 less than or equal to 2^2=4: [4,2], [4,1,1], [2,2,2], [2,2,1,1], [2,1,1,1,1], [1,1,1,1,1,1].
%e A181322 Square array A(n,k) begins:
%e A181322 1, 1, 1, 1, 1, 1, ...
%e A181322 1, 2, 2, 2, 2, 2, ...
%e A181322 1, 3, 4, 4, 4, 4, ...
%e A181322 1, 4, 6, 6, 6, 6, ...
%e A181322 1, 5, 9, 10, 10, 10, ...
%e A181322 1, 6, 12, 14, 14, 14, ...
%p A181322 b:= proc(n, j) local nn, r;
%p A181322 if n<0 then 0
%p A181322 elif j=0 then 1
%p A181322 elif j=1 then n+1
%p A181322 elif n<j then b(n, j):= b(n-1, j) +b(2*n, j-1)
%p A181322 else nn:= 1 +floor(n);
%p A181322 r:= n-nn;
%p A181322 (nn-j) *binomial(nn, j) *add(binomial(j, h)
%p A181322 /(nn-j+h) *b(j-h+r, j) *(-1)^h, h=0..j-1)
%p A181322 fi
%p A181322 end:
%p A181322 A:= (n, k)-> b(n/2^(k-1), k):
%p A181322 seq(seq(A(n, d-n), n=0..d), d=0..13);
%t A181322 b[n_, j_] := b[n, j] = Module[{nn, r}, Which[n<0, 0, j == 0, 1, j == 1, n+1, n<j, b[n, j] = b[n-1, j] + b[2*n, j-1], True, nn = Floor[n]+1; r = n - nn; (nn-j)*Binomial[nn, j]*Sum[(Binomial[j, h]*b[j-h+r, j]*(-1)^h)/(nn-j+h), {h, 0, j-1}]]]; A[n_, k_] := b[n/2^(k-1), k]; Table[Table[A[n, d-n], {n, 0, d}], {d, 0, 13}] // Flatten (* _Jean-François Alcover_, Jan 15 2014, translated from Maple *)
%o A181322 (PARI) A181322(n,k,r=1)={if(n<r,r,!k,1, r&&n/=2^(k-1); k==1, n+1, n<k, A181322(n-1,k,0)+A181322(2*n,k-1,0),n-=r=1+n\1,(r-k)*binomial(r,k)*sum(i=0,min(k-1,k+n), binomial(k,i)/(r-k+i)*A181322(k-i+n,k,0) *(-1)^i))} \\ From Maple. - _M. F. Hasler_, Feb 19 2019
%Y A181322 Columns k=0-5 give: A000012, A000027(n+1), A002620(n+2), A008804, A088932, A088954.
%Y A181322 Main diagonal gives A000123.
%Y A181322 Cf. A145515.
%Y A181322 See A262553 for another version of this array.
%Y A181322 See A072170 for a related array (having the same limiting column).
%K A181322 nonn,tabl
%O A181322 0,5
%A A181322 _Alois P. Heinz_, Jan 26 2011