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!)
A365525 a(n) = Sum_{k=0..floor(n/4)} Stirling2(n,4*k). 3
1, 0, 0, 0, 1, 10, 65, 350, 1702, 7806, 34855, 157630, 770529, 4432220, 31307432, 259090260, 2316320073, 21172354778, 193091210857, 1744478148866, 15627203762926, 139526376391986, 1251976261264071, 11417796498945894, 107280845105151601 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,6
LINKS
FORMULA
Let A(0)=1, B(0)=0, C(0)=0 and D(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) and A(n+1) = Sum_{k=0..n} binomial(n,k)*D(k). a(n) = A(n), A365526(n) = B(n), A365527(n) = C(n) and A099948(n) = D(n).
G.f.: Sum_{k>=0} x^(4*k) / Product_{j=1..4*k} (1-j*x).
MATHEMATICA
a[n_] := Sum[StirlingS2[n, 4*k], {k, 0, Floor[n/4]}]; Array[a, 25, 0] (* Amiram Eldar, Sep 11 2023 *)
PROG
(PARI) a(n) = sum(k=0, n\4, stirling(n, 4*k, 2));
(Python)
from sympy.functions.combinatorial.numbers import stirling
def A365525(n): return sum(stirling(n, k<<2) for k in range((n>>2)+1)) # Chai Wah Wu, Sep 08 2023
CROSSREFS
Sequence in context: A056280 A000453 A365532 * A327505 A346954 A346895
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 April 30 12:41 EDT 2024. Contains 372134 sequences. (Running on oeis4.)