|
Search: id:A132341
|
|
| |
|
| 1, 2, 10, 168, 4290, 136136, 4938024, 196125600, 8318177010, 370784099400, 17184867259560, 821870841735840, 40334204896057800, 2022686389717666848, 103312949950998743200, 5360873347802169267840, 282015983963437605168210
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
G. Kreweras, Sur une classe de problemes de denombrement lies au treillis des partitions des entiers, Cahiers du Bureau Universitaire de Recherche Op\'{e}rationnelle, Institut de Statistique, Universit\'{e} de Paris, 6 (1965), circa p. 82.
|
|
FORMULA
|
a(n) is found by setting h=k=n in A(n,k) = 2(-1)^(h+k) (h+k-1)! (2h+2k-3)! / ( h! k! (2h-1)! (2k-1)! ), h >= 0, k >= 0.
|
|
CROSSREFS
|
Sequence in context: A007131 A126449 A126451 this_sequence A069994 A063573 A086675
Adjacent sequences: A132338 A132339 A132340 this_sequence A132342 A132343 A132344
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Nov 08 2007
|
|
EXTENSIONS
|
More terms from Max Alekseyev (maxale(AT)gmail.com), Sep 12 2009
|
|
|
Search completed in 0.002 seconds
|
