cp's OEIS Frontend

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.

A108456 Table read by antidiagonals: T(n,k) = number of partitions of (n,k) into pairs (i,j) with i>0, j>=0.

This page as a plain text file.
%I A108456 #4 Mar 30 2012 17:37:15
%S A108456 1,0,1,0,1,2,0,1,2,3,0,1,3,4,5,0,1,3,6,7,7,0,1,4,8,12,12,11,0,1,4,10,
%T A108456 16,21,19,15,0,1,5,12,23,31,36,30,22,0,1,5,15,28,45,55,58,45,30,0,1,6,
%U A108456 17,37,60,84,94,92,67,42,0,1,6,20,44,80,115,147,153,140,97,56,0,1,7,23
%N A108456 Table read by antidiagonals: T(n,k) = number of partitions of (n,k) into pairs (i,j) with i>0, j>=0.
%C A108456 (a,b)+(x,y)=(a+x,b+y); unit is (0,0).
%H A108456 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%F A108456 Euler transform of table whose g.f. is x/((1-x)*(1-y)).
%e A108456 1 0 0 0 0 ...
%e A108456 1 1 1 1 1 ...
%e A108456 2 2 3 3 4 ...
%e A108456 3 4 6 8 10 ...
%e A108456 5 7 12 16 23 ...
%e A108456 (3,2)=(2,2)+(1,0)=(2,1)+(1,1)=(2,0)+(1,2)=(1,2)+(1,0)+(1,0)=(1,1)+(1,1)+(1,0), so a(3,2)=6.
%Y A108456 Cf. A108461, A108455. Columns 0-1: A000041, A000070. Main diagonal: A108457.
%K A108456 nonn,tabl
%O A108456 0,6
%A A108456 _Christian G. Bower_, Jun 03 2005