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!)
A365531 a(n) = Sum_{k=0..floor((n-3)/5)} Stirling2(n,5*k+3). 4

%I #8 Sep 08 2023 07:22:52

%S 0,0,0,1,6,25,90,301,967,3061,10080,40381,245553,2161238,21701381,

%T 219007491,2149071359,20442363031,189226358659,1712836890912,

%U 15232581945180,133717667932475,1164901223314180,10143255631462661,89207257764369032,804712211338739040

%N a(n) = Sum_{k=0..floor((n-3)/5)} Stirling2(n,5*k+3).

%F Let A(0)=1, B(0)=0, C(0)=0, D(0)=0 and E(0)=0. Let B(n+1) = Sum_{k=0..n} binomial(n,k)*A(k), C(n+1) = Sum_{k=0..n} binomial(n,k)*B(k), D(n+1) = Sum_{k=0..n} binomial(n,k)*C(k), E(n+1) = Sum_{k=0..n} binomial(n,k)*D(k) and A(n+1) = Sum_{k=0..n} binomial(n,k)*E(k). A365528(n) = A(n), A365529(n) = B(n), A365530(n) = C(n), a(n) = D(n) and A365532(n) = E(n).

%F G.f.: Sum_{k>=0} x^(5*k+3) / Product_{j=1..5*k+3} (1-j*x).

%o (PARI) a(n) = sum(k=0, (n-3)\5, stirling(n, 5*k+3, 2));

%Y Cf. A365528, A365529, A365530, A365532.

%K nonn

%O 0,5

%A _Seiichi Manyama_, Sep 08 2023

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 27 09:17 EDT 2024. Contains 375468 sequences. (Running on oeis4.)