Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091298
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091298 Triangle read by rows: T[n,k]= plane partitions of n containing k parts. +0
1
1, 1, 2, 1, 2, 3, 1, 4, 3, 5, 1, 4, 7, 5, 7, 1, 6, 10, 13, 7, 11, 1, 6, 14, 20, 19, 11, 15, 1, 8, 18, 33, 32, 31, 15, 22, 1, 8, 25, 43, 56, 54, 43, 22, 30, 1, 10, 29, 66, 81, 99, 78, 64, 30, 42, 1, 10, 37, 83, 126, 150, 148, 118, 88, 42, 56, 1, 12, 44, 114, 174, 246, 235, 230, 166, 124 (list; table; graph; listen)
OFFSET

1,3

COMMENT

first column is 1, representing the single-part {{n}}, last column is P(n), since the all-ones plane partitions form the Ferrers-Young plots of the (linear) partitions of n.

EXAMPLE

This plane partition of n=7: {{3,1,1},{2}} contains 4 parts: 3,1,1,2

MATHEMATICA

(* see A089924 for "planepartition" *) Table[Length /@ Split[Sort[Length /@ Flatten /@ planepartitions[n]]], {n, 16}]

CROSSREFS

Cf. A090539, A092288, A089924.

Sequence in context: A132163 A110582 A162507 this_sequence A055884 A055889 A125930

Adjacent sequences: A091295 A091296 A091297 this_sequence A091299 A091300 A091301

KEYWORD

nonn,tabl

AUTHOR

Wouter Meeussen (wouter.meeussen(AT)pandora.be), Feb 24 2004

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research