This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A079211 Triangle t(n,k) of numbers of partitions of n into distinct numbers not less k, 0<=k<=n. 9
 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 4, 2, 1, 1, 1, 1, 1, 5, 3, 2, 1, 1, 1, 1, 1, 6, 3, 2, 1, 1, 1, 1, 1, 1, 8, 5, 3, 2, 1, 1, 1, 1, 1, 1, 10, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 12, 7, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 15, 8, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 18, 10, 6, 4, 3, 2, 1, 1, 1, 1, 1, 1 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,7 COMMENTS t(n,k+1)<=t(n,k)<=t(n+1,k); t(n,k)>1 iff 0<=2*k+1j>k and i+j=n), 0<=k<=n. CROSSREFS A000009(n)=t(n, 0), left border of the triangle, A025147(n)=t(n, 1) for n>1. Sequence in context: A101873 A177991 A146289 * A214575 A081418 A088951 Adjacent sequences:  A079208 A079209 A079210 * A079212 A079213 A079214 KEYWORD nonn,tabl AUTHOR Reinhard Zumkeller, Jan 01 2003 STATUS approved

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

Content is available under The OEIS End-User License Agreement .