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!)
A217392 Alternating sums of the squares of the ordered Bell numbers (number of preferential arrangements) A000670. 4
1, 0, 9, 160, 5465, 287216, 21643273, 2214984576, 295720862649, 49933547619472, 10404630591819497, 2622531836368780832, 786513638108085303193, 276793205620647080017968, 112961387008976003691598281, 52917386659933341334644891328, 28203267311410367019573922744697 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = sum((-1)^(n-k)*t(k)^2, k=0..n), where t = A000670 (ordered Bell numbers).
a(n) ~ (n!)^2 / (4 * (log(2))^(2*n+2)). - Vaclav Kotesovec, Nov 08 2014
MATHEMATICA
t[n_] := Sum[StirlingS2[n, k]k!, {k, 0, n}]; Table[Sum[(-1)^(n-k)t[k]^2, {k, 0, n}], {n, 0, 100}]
PROG
(Maxima)
t(n):=sum(stirling2(n, k)*k!, k, 0, n);
makelist(sum((-1)^(n-k)*t(k)^2, k, 0, n), n, 0, 40);
(Magma)
A000670:=func<n | &+[StirlingSecond(n, i)*Factorial(i): i in [0..n]]>;
[&+[(-1)^(n-k)*A000670(k)^2: k in [0..n]]: n in [0..14]]; // Bruno Berselli, Oct 03 2012
(PARI) for(n=0, 30, print1(sum(k=0, n, (-1)^(n-k)*(sum(j=0, k, j!*stirling(k, j, 2)))^2), ", ")) \\ G. C. Greubel, Feb 07 2018
CROSSREFS
Sequence in context: A365016 A367163 A363479 * A327978 A062232 A337627
KEYWORD
nonn
AUTHOR
Emanuele Munarini, Oct 02 2012
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 March 19 03:17 EDT 2024. Contains 370952 sequences. (Running on oeis4.)