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!)
A354752 a(n) = Sum_{k=0..n} Stirling1(n,k) * k! * n^(n-k). 1
1, 1, 0, 6, -152, 6670, -451152, 43685208, -5741360256, 984176280288, -213379094227200, 57100689621382176, -18489130293293779968, 7125765731670143814672, -3223822934974620319272960, 1692009521117003600170128000, -1019755541584493644326799048704 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
FORMULA
a(n) = n! * [x^n] 1 / (1 - log(1 + n*x) / n) for n > 0.
a(n) ~ (-1)^(n+1) * n! * n^(n-2). - Vaclav Kotesovec, Jun 06 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, Jun 06 2022
CROSSREFS
Sequence in context: A003766 A278728 A221689 * A319036 A185211 A046182
KEYWORD
sign
AUTHOR
Ilya Gutkovskiy, Jun 06 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 September 7 13:22 EDT 2024. Contains 375730 sequences. (Running on oeis4.)