[go: up one dir, main page]

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!)
A357739 a(n) = Sum_{k=0..floor((n-1)/2)} (-n)^k * Stirling2(n,2*k+1). 0
0, 1, 1, -2, -23, -99, 1, 4411, 45137, 205570, -1270799, -38876573, -441073511, -1921300835, 34908578433, 994442615986, 13032718992033, 59450652771077, -1794250960044623, -57608157168424497, -901446808420344919, -5274602459214885362, 160827105304127790529 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
Eric Weisstein's MathWorld, Bell Polynomial.
FORMULA
For n > 0, a(n) = n! * [x^n] sin( sqrt(n) * (exp(x) - 1) )/sqrt(n).
For n > 0, a(n) = ( Bell_n(sqrt(n) * i) - Bell_n(-sqrt(n) * i) )/(2 * sqrt(n) * i), where Bell_n(x) is n-th Bell polynomial and i is the imaginary unit.
PROG
(PARI) a(n) = sum(k=0, (n-1)\2, (-n)^k*stirling(n, 2*k+1, 2));
(PARI) a(n) = if(n==0, 0, round(n!*polcoef(sin(sqrt(n)*(exp(x+x*O(x^n))-1))/sqrt(n), n)));
(PARI) Bell_poly(n, x) = exp(-x)*suminf(k=0, k^n*x^k/k!);
a(n) = if(n==0, 0, round((Bell_poly(n, sqrt(n)*I)-Bell_poly(n, -sqrt(n)*I))/(2*sqrt(n)*I)));
CROSSREFS
Sequence in context: A239186 A238185 A053999 * A131176 A141405 A068876
KEYWORD
sign
AUTHOR
Seiichi Manyama, Oct 11 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 August 29 18:55 EDT 2024. Contains 375518 sequences. (Running on oeis4.)