The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A061198 Square table by antidiagonals where T(n,k) is number of partitions of k where no part appears more than n times; also partitions of k where no parts are multiples of (n+1). 4
 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 2, 2, 1, 1, 0, 2, 2, 2, 1, 1, 0, 3, 4, 3, 2, 1, 1, 0, 4, 5, 4, 3, 2, 1, 1, 0, 5, 7, 6, 5, 3, 2, 1, 1, 0, 6, 9, 9, 6, 5, 3, 2, 1, 1, 0, 8, 13, 12, 10, 7, 5, 3, 2, 1, 1, 0, 10, 16, 16, 13, 10, 7, 5, 3, 2, 1, 1, 0, 12, 22, 22, 19, 14, 11, 7, 5, 3, 2, 1, 1, 0, 15, 27, 29, 25 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,12 LINKS CROSSREFS Rows include A000007, A000009, A000726, A035959. Main diagonal is A000041. A061199 is the same table but excluding cases where n>k. Sequence in context: A119557 A125919 A241079 * A195011 A290942 A039801 Adjacent sequences:  A061195 A061196 A061197 * A061199 A061200 A061201 KEYWORD nonn,tabl AUTHOR Henry Bottomley, Apr 20 2001 STATUS approved

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

Last modified August 13 02:09 EDT 2020. Contains 336441 sequences. (Running on oeis4.)