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!)
Search: seq:1,1,0 seq:-9 seq:-40,125,3444,18571 seq:-241872 seq:-5796711
(Hint: to search for an exact subsequence, use commas to separate the numbers.)
Displaying 1-1 of 1 result found. page 1
     Sort: relevance | references | number | modified | created      Format: long | short | data
A344053 a(n) = Sum_{k=0..n} (-1)^(n-k)*binomial(n, k)*Stirling2(n, k)*k!. +100
1
1, 1, 0, -9, -40, 125, 3444, 18571, -241872, -5796711, -24387220, 1132278191, 25132445832, 8850583573, -10681029498972, -214099676807085, 1643397436986464, 176719161389104817, 2976468247699317468, -71662294521163070153, -4638920054290748840520, -55645074852328083377619 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
Inverse binomial convolution of the Fubini numbers (A131689).
LINKS
FORMULA
a(n) = Sum_{k=0..n} (-1)^k * A219859(n,k). - Alois P. Heinz, Jan 24 2022
MATHEMATICA
a[n_] := Sum[(-1)^(n - k) * Binomial[n, k] * StirlingS2[n, k] * k!, {k, 0, n}]; Array[a, 22, 0] (* Amiram Eldar, May 10 2021 *)
PROG
(PARI) a(n) = sum(k=0, n, (-1)^(n-k)*binomial(n, k)*stirling(n, k, 2)*k!); \\ Michel Marcus, May 10 2021
CROSSREFS
KEYWORD
sign
AUTHOR
Peter Luschny, May 10 2021
STATUS
approved
page 1

Search completed in 0.025 seconds

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 June 29 15:42 EDT 2024. Contains 373851 sequences. (Running on oeis4.)