|
Search: id:A026004
|
|
| |
|
| 1, 3, 14, 75, 429, 2548, 15504, 95931, 600875, 3798795, 24192090, 154969620, 997490844, 6446369400, 41802112192, 271861216539, 1772528290407, 11582393855305, 75831424919250, 497337483739635, 3266814940064445
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Number of standard tableaux of shape (2n+1,n). Example: a(1)=3 because in the top row we can have 134, 124, or 123 (but not 234). - Emeric Deutsch (deutsch(AT)duke.poly.edu), May 23 2004
Number of noncrossing forests with n+2 vertices and two components. - Emeric Deutsch (deutsch(AT)duke.poly.edu), May 31 2004
|
|
REFERENCES
|
P. Flajolet and M. Noy, Analytic combinatorics of noncrossing configurations, Discrete Math. 204 (1999), 203-229.
|
|
FORMULA
|
(n+2)/(2n+2) * C(3n+1, n). - R. Stephan, Apr 30 2004
|
|
CROSSREFS
|
Cf. A045722.
Adjacent sequences: A026001 A026002 A026003 this_sequence A026005 A026006 A026007
Sequence in context: A080238 A074549 A126122 this_sequence A063016 A133798 A100937
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
EXTENSIONS
|
More terms from R. Stephan, Apr 30 2004
|
|
|
Search completed in 0.002 seconds
|
