|
Search: id:A059386
|
|
|
| A059386 |
|
Expansion of cosh(cosh(x)-1). |
|
+0
1
|
|
| 1, 0, 3, 15, 168, 3405, 77253, 2151240, 77493783, 3369709995, 169438618608, 9847267355145, 658888820876553, 49985438650733040, 4245160431876404043, 401030532597501719655, 41924382309752516224728, 4820179120197824593864965
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
a(n) is the number of partitions of the set {1, 2, ..., 2n-1} into an even number of blocks, each containing an even number of elements. - Isabel C. Lugo (izzycat(AT)gmail.com), Aug 23 2004
|
|
REFERENCES
|
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 226, 9th line of table.
|
|
CROSSREFS
|
Sequence in context: A015013 A153280 A132683 this_sequence A077792 A153079 A087614
Adjacent sequences: A059383 A059384 A059385 this_sequence A059387 A059388 A059389
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jan 28 2001
|
|
|
Search completed in 0.002 seconds
|
