Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A061198
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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). +0
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; listen)
OFFSET

0,12

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: A112183 A119557 A125919 this_sequence A039801 A105821 A004564

Adjacent sequences: A061195 A061196 A061197 this_sequence A061199 A061200 A061201

KEYWORD

nonn,tabl

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Apr 20 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 16 13:01 EST 2009. Contains 170825 sequences.


AT&T Labs Research