cp's OEIS Frontend

A157045 Triangular table: number of partitions of n into exactly n-k parts, each <= n-k. Same as A157044 but with rows reversed.

%I A157045 #3 Mar 30 2012 18:37:44
%S A157045 1,1,0,1,1,0,1,1,1,0,1,1,2,0,0,1,1,2,2,0,0,1,1,2,3,2,0,0,1,1,2,3,4,1,
%T A157045 0,0,1,1,2,3,5,4,1,0,0,1,1,2,3,5,6,5,0,0,0,1,1,2,3,5,7,8,4,0,0,0,1,1,
%U A157045 2,3,5,7,10,9,4,0,0,0,1,1,2,3,5,7,11,12,11,3,0,0,0,1,1,2,3,5,7,11,14,16,11
%N A157045 Triangular table: number of partitions of n into exactly n-k parts, each <= n-k. Same as A157044 but with rows reversed.
%C A157045 See A157044. Rows approach the partition numbers.
%D A157045 George E. Andrews, The Theory of Partitions, Addison-Wesley, Reading, Mass., 1976 (Theorem 1.5).
%t A157045 Table[T[n-1,n-k,n-k+2]-T[n-1,n-k-1,n-k+2],{n,1,9},{k,1,n}] with T[n,a,b] as defined in A047993.
%Y A157045 Cf. A000041, A157044, A157046, A047993
%K A157045 nonn,tabl
%O A157045 1,13
%A A157045 _Wouter Meeussen_, Feb 22 2009