login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070936 Square array read by antidiagonals: T(n,k) = number of partitions of n into distinct parts, each no more than k. 4

%I #18 Oct 26 2017 08:54:52

%S 1,1,0,1,1,0,1,1,0,0,1,1,1,0,0,1,1,1,1,0,0,1,1,1,2,0,0,0,1,1,1,2,1,0,

%T 0,0,1,1,1,2,2,1,0,0,0,1,1,1,2,2,2,1,0,0,0,1,1,1,2,2,3,2,0,0,0,0,1,1,

%U 1,2,2,3,3,2,0,0,0,0,1,1,1,2,2,3,4,3,1,0,0,0,0,1,1,1,2,2,3,4,4,3,1,0,0,0,0

%N Square array read by antidiagonals: T(n,k) = number of partitions of n into distinct parts, each no more than k.

%H Seiichi Manyama, <a href="/A070936/b070936.txt">Antidiagonals n = 0..139, flattened</a>

%H Henry Bottomley, <a href="http://www.se16.info/js/partitions.htm">Partition calculators using java applets</a>

%H <a href="/index/Par#part">Index entries for sequences related to partitions</a>

%F T(n, k) =T(n-1, k)+T(n-1, k-n) (with T(0, 0)=1) =A053632(k, n) =A026836(n+k+1, k+1) =sum_{0<=j<=k}A026836(n, j). For k>=n, T(n, k)=T(n, n)=A000009(n).

%e Rows start

%e 1,1,1,1,1,...;

%e 0,1,1,1,1,...;

%e 0,0,1,1,1,...;

%e 0,0,1,2,2,...;

%e 0,0,0,1,2,...; etc.

%e T(10,5)=3 since 10 can be partitioned 3 ways as 5+4+1=5+3+2=4+3+2+1 with each part less than or equal to 5.

%Y Cf. A008284, A060016. With some imagination, this is the transpose of A026836 and A053632. Column sums are 2^k=A000079(k). Column maximum is A025591(k), which appears A070936(k) times in the column.

%K nonn,tabl,look

%O 0,25

%A _Henry Bottomley_, May 12 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)