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!)
A365530 a(n) = Sum_{k=0..floor((n-2)/5)} Stirling2(n,5*k+2). 4
0, 0, 1, 3, 7, 15, 31, 64, 155, 717, 6391, 65010, 629444, 5719597, 49340838, 408864186, 3284672489, 25770192646, 198718943490, 1516391860879, 11554571944615, 89144035246500, 711587142257776, 6054854693784594, 56609279400922224, 590143167134961765 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
FORMULA
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), a(n) = C(n), A365531(n) = D(n) and A365532(n) = E(n).
G.f.: Sum_{k>=0} x^(5*k+2) / Product_{j=1..5*k+2} (1-j*x).
PROG
(PARI) a(n) = sum(k=0, (n-2)\5, stirling(n, 5*k+2, 2));
CROSSREFS
Sequence in context: A309172 A178459 A129984 * A351707 A146811 A147235
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Sep 08 2023
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 27 09:19 EDT 2024. Contains 375468 sequences. (Running on oeis4.)