|
Search: id:A115965
|
|
|
| A115965 |
|
Number of planar subpartitions of size n pyramidal planar partition. |
|
+0
1
|
| |
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
This is a 2-dimensional analog of the Catalan numbers C_n (A000108). The number of subpartitions of the triangular partition [n,n-1,...,1] is C_{n+1}. The planar partition having its subpartitions counted is:
n n-1 ... 2 1
n-1 n-2 ... 1
... ...
2 1
1
|
|
EXAMPLE
|
The 9 planar subpartitions of [2,1|1] are [], [1], [2], [1,1], [1|1], [2,1], [2|1], [1,1|1] and [2,1|1] itself, so a(2)=9. (Here "," separates values on the same line and "|" separates lines.)
|
|
CROSSREFS
|
Cf. A115728, A115729, A000219, A000108, A008793.
Sequence in context: A011837 A106343 A086992 this_sequence A001142 A111847 A013132
Adjacent sequences: A115962 A115963 A115964 this_sequence A115966 A115967 A115968
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Frank Adams-Watters (FrankTAW(AT)Netscape.net), Mar 14 2006
|
|
|
Search completed in 0.002 seconds
|
