|
| |
|
|
A052819
|
|
E.g.f. A(x) is inverse to F(x)=(x + x*log(1-x))
|
|
1
| |
|
|
0, 1, 2, 15, 188, 3300, 74484, 2054864, 66998448, 2520581400, 107472778320, 5121576763512, 269759385873504, 15561785854196400, 975788232119245440, 66080957140527828480, 4806533577745476290304, 373724762062131412853760
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
LINKS
| INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 784
|
|
|
FORMULA
| E.g.f. satisfies: A(x + x*log(1-x)) = x. [From Paul D. Hanna (pauldhanna(AT)juno.com), Aug 28 2008]
a(n)=sum(k=0..n-1, k!*(-1)^(n+k-1)*stirling1(n-1,k)*binomial(n+k-1,n-1)). [From Vladimir Kruchinin, Feb 01 2012]
|
|
|
MAPLE
| spec := [S, {C=Sequence(B), B=Cycle(S), S=Prod(C, Z)}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);
|
|
|
PROG
| (PARI) a(n)=n!*polcoeff(serreverse(x+x*log(1-x +x*O(x^n))), n) [From Paul D. Hanna (pauldhanna(AT)juno.com), Aug 28 2008]
(Maxima) a(n):=(sum(k!*(-1)^(n+k-1)*stirling1(n-1, k)*binomial(n+k-1, n-1), k, 0, n-1)); [From Vladimir Kruchinin, Feb 01 2012]
|
|
|
CROSSREFS
| Cf. A052802. [From Paul D. Hanna (pauldhanna(AT)juno.com), Aug 28 2008]
Sequence in context: A052857 A053492 A098343 * A127090 A198522 A187655
Adjacent sequences: A052816 A052817 A052818 * A052820 A052821 A052822
|
|
|
KEYWORD
| easy,nonn,changed
|
|
|
AUTHOR
| encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
| |
|
|
