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!)
A122486 a(n) = Sum_{k=0..n} |Stirling1(n,k)|*Bell(k)^2. 0

%I #17 May 05 2019 00:32:51

%S 1,1,5,39,425,6053,107735,2321469,59152987,1750362419,59286010621,

%T 2271617296347,97502863649141,4649359584613201,244550369307356039,

%U 14101227268075911837,886551391533830227267,60482082002935189216499

%N a(n) = Sum_{k=0..n} |Stirling1(n,k)|*Bell(k)^2.

%C Row sums of the absolute values of the triangle of Stirling1(n,k)*Bell(k)^2:

%C 1;

%C 0, 1;

%C 0, -1, 4;

%C 0, 2, -12, 25;

%C 0, -6, 44, -150, 225;

%C 0, 24, -200, 875, -2250, 2704;

%C 0, -120, 1096, -5625, 19125, -40560, 41209;

%C 0, 720, -7056, 40600, -165375, 473200, -865389, 769129;

%C ... - _R. J. Mathar_, Jan 27 2017

%F a(n) = exp(-2)*Sum_{r,s>=0} [r*s]^n/(r!*s!), where [m]^n = m*(m+1)*...*(m+n-1) is the rising factorial.

%F E.g.f.: Sum_{n>=0} exp( 1/(1-x)^n - 2 ) / n!. - _Paul D. Hanna_, Jul 25 2018

%p with(combinat): seq(sum(abs(stirling1(n,k))*bell(k)^2,k=0..n),n=0..19); # _Emeric Deutsch_, Oct 08 2006

%Y Cf. A000110, A059849.

%K nonn,easy

%O 0,3

%A _Vladeta Jovovic_, Sep 15 2006, Sep 19 2006

%E More terms from _Emeric Deutsch_, Oct 08 2006

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 17 22:52 EDT 2024. Contains 375240 sequences. (Running on oeis4.)