id:A098529 - OEIS Search Results

Search: id:A098529

Displaying 1-1 of 1 results found.

page 1

Triangle read by rows: T(n,k) counts plane partitions of n+1 that can be 'shrunk' in k ways to a plane partition of n by removing 1 element from it. Equivalently, it counts how many partitions of n+1 have k different partitions of n it just covers.

+0
3

1, 3, 3, 3, 6, 6, 1, 3, 18, 3, 9, 24, 15, 3, 42, 38, 3, 10, 60, 69, 21, 6, 72, 153, 45, 6, 9, 114, 220, 141, 15, 1, 3, 120, 399, 274, 60, 3, 18, 159, 558, 570, 162, 12, 3, 174, 834, 1029, 399, 46, 9, 267, 1080, 1749, 921, 138, 3 (list; graph; listen)

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research