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!)
A192556 a(n) = sum(abs(stirling1(n+1,k+1))*(-1)^(n-k)*k!^2,k=0..n). 0

%I #6 Jul 05 2021 07:22:15

%S 1,0,3,17,330,8074,295792,14593424,939884432,76503823776,

%T 7681082731344,932507036530992,134658378428217696,

%U 22811930868689642016,4480422956516411159616,1009922628068732158507584,258952863907653970063080960

%N a(n) = sum(abs(stirling1(n+1,k+1))*(-1)^(n-k)*k!^2,k=0..n).

%F a(n) ~ exp(-1/2) * n!^2. - _Vaclav Kotesovec_, Jul 05 2021

%t Table[Sum[Abs[StirlingS1[n+1,k+1]](-1)^(n-k)k!^2,{k,0,n}],{n,0,100}]

%o (Maxima) makelist(sum(abs(stirling1(n+1,k+1))*(-1)^(n-k)*k!^2,k,0,n),n,0,24);

%K nonn

%O 0,3

%A _Emanuele Munarini_, Jul 04 2011

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 July 3 18:06 EDT 2024. Contains 373982 sequences. (Running on oeis4.)