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!)
A352074 a(n) = Sum_{k=0..n} Stirling1(n,k) * k! * (-n)^(n-k). 3
1, 1, 4, 42, 904, 34070, 2019888, 174588120, 20804747136, 3276218158560, 659664288364800, 165425062846302336, 50574549124825998336, 18520126461205806360144, 8003819275469728355033088, 4031020344281171589447408000, 2340375822778055527109749211136 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = n! * [x^n] 1 / (1 + log(1 - n*x) / n) for n > 0.
a(n) ~ n! * n^(n-2) * (1 + 2*log(n)/n). - Vaclav Kotesovec, Mar 03 2022
MATHEMATICA
Unprotect[Power]; 0^0 = 1; Table[Sum[StirlingS1[n, k] k! (-n)^(n - k), {k, 0, n}], {n, 0, 16}]
Join[{1}, Table[n! SeriesCoefficient[1/(1 + Log[1 - n x]/n), {x, 0, n}], {n, 1, 16}]]
PROG
(PARI) a(n) = sum(k=0, n, stirling(n, k, 1)*k!*(-n)^(n-k)); \\ Michel Marcus, Mar 02 2022
CROSSREFS
Cf. A081048.
Sequence in context: A338194 A241030 A143990 * A267616 A243809 A220180
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Mar 02 2022
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 April 19 02:45 EDT 2024. Contains 371782 sequences. (Running on oeis4.)