|
Search: id:A053492
|
|
|
| A053492 |
|
REVEGF transform of [1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,...]. |
|
+0
1
|
|
| 1, -2, 15, -184, 3155, -69516, 1871583, -59542064, 2185497819, -90909876100, 4226300379983, -217152013181544, 12219893000227107, -747440554689309404, 49374719534173925055, -3503183373320829575008, 265693897270211120103563
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Unsigned sequence gives the number of total circled paritions of n. This is the number of ways to partition n into at least two blocks, circle one block, then successively partition each non-singleton block into at least two blocks and circle one of the blocks. Stop when only singleton blocks remain. - Brian Drake (bdrake(AT)brandeis.edu), Apr 25 2006
This sequence is incorrectly labeled. The REVEGF transform of [1, -1, -1, -1, -1, -1, ... ], the sequence whose exponential generating function is the compositional inverse of 2*x - x*exp(x), is this sequence with all positive signs. - Brian Drake (bdrake(AT)brandeis.edu), Jun 16 2006
|
|
LINKS
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 854
|
|
FORMULA
|
E.g.f. is the compositional inverse of 2*x-x*exp(x) - Brian Drake (bdrake(AT)brandeis.edu), Apr 25 2006
|
|
MAPLE
|
A:= series(RootOf(exp(_Z)*_Z+x-2*_Z), x, 30): A053492:= n-> n! * coeff(A, x, n); - Brian Drake (bdrake(AT)brandeis.edu), Apr 25 2006
|
|
CROSSREFS
|
Cf. A000311, A029768.
Sequence in context: A121427 A099709 A052857 this_sequence A098343 A052819 A127090
Adjacent sequences: A053489 A053490 A053491 this_sequence A053493 A053494 A053495
|
|
KEYWORD
|
sign
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jan 15 2000
|
|
|
Search completed in 0.002 seconds
|
