login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A334986 a(n) = exp(n) * Sum_{k>=0} (-1)^k * n^(k-1) * k^(n-1) / k!. 2
1, -1, 2, -5, 9, 53, -1107, 12983, -116470, 560049, 8370713, -346902877, 7551856337, -117404648467, 913399734614, 22560135521007, -1393700803877939, 44331044030953865, -979905458659247779, 10462396536804802459, 367799071887303276422, -30046998012662824941947 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
Eric Weisstein's World of Mathematics, Bell Polynomial
FORMULA
a(n) = Sum_{k=0..n-1} (-1)^k * Stirling2(n-1,k) * n^(k-1).
a(n) = BellPolynomial_(n-1)(-n) / n.
MATHEMATICA
Table[Sum[(-1)^k StirlingS2[n - 1, k] n^(k - 1), {k, 0, n - 1}], {n, 1, 22}]
Table[BellB[n - 1, -n]/n, {n, 1, 22}]
PROG
(PARI) a(n)={sum(k=0, n-1, (-1)^k * stirling(n-1, k, 2) * n^(k-1))} \\ Andrew Howroyd, May 18 2020
CROSSREFS
Sequence in context: A247550 A249583 A109469 * A185160 A289942 A239899
KEYWORD
sign
AUTHOR
Ilya Gutkovskiy, May 18 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 8 00:02 EDT 2024. Contains 372317 sequences. (Running on oeis4.)