This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A058398 Partition triangle A008284 read from right to left. 7
 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 2, 3, 3, 1, 1, 1, 2, 3, 4, 3, 1, 1, 1, 2, 3, 5, 5, 4, 1, 1, 1, 2, 3, 5, 6, 7, 4, 1, 1, 1, 2, 3, 5, 7, 9, 8, 5, 1, 1, 1, 2, 3, 5, 7, 10, 11, 10, 5, 1, 1, 1, 2, 3, 5, 7, 11, 13, 15, 12, 6, 1, 1, 1, 2, 3, 5, 7, 11, 14, 18, 18, 14, 6, 1, 1, 1, 2, 3, 5, 7, 11 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,9 COMMENTS a(n,m) is the number of partitions of n with n-(m-1) parts or, equivalently, with greatest part n-(m-1). The columns are the diagonals of triangle A008284. The diagonals are the columns of the partition array p(n,m), n >= 0, m >= 1, with p(n,m) the number of partitions of n in which every part is <= m; p(0,m) := 1. For n >= 1 this array is obtained from table A026820 read as lower triangular array with extension of the rows according to p(n,m)=A000041(n) for m>n. REFERENCES L. Comtet, Advanced Combinatorics, Reidel, 1974, pp. 94, 96 and 307. M. Kauers and P. Paule, The Concrete Tetrahedron, Springer 2011, p. 27. LINKS Seiichi Manyama, Rows n = 1..140, flattened H. Bottomley, Illustration of initial terms FORMULA a(n, m)= A008284(n, n-(m-1)). a(n, m)= p(m-1, n-m+1), n >= m >= 1 with the p(n, m) array defined in the comment. a(n, m)=0 if n

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

Last modified October 21 14:57 EDT 2018. Contains 316424 sequences. (Running on oeis4.)