The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A360090 a(n) = Sum_{k=0..n} binomial(5*k,n-k). 2
 1, 1, 6, 21, 71, 251, 882, 3088, 10829, 37975, 133146, 466852, 1636944, 5739647, 20125051, 70564951, 247423522, 867546829, 3041899638, 10665883415, 37398034921, 131129599227, 459782762029, 1612146986543, 5652708454881, 19820223058176, 69496108849357 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Table of n, a(n) for n=0..26. Index entries for linear recurrences with constant coefficients, signature (1,5,10,10,5,1). FORMULA a(n) = a(n-1) + 5*a(n-2) + 10*a(n-3) + 10*a(n-4) + 5*a(n-5) + a(n-6). G.f.: 1/(1 - x*(1+x)^5). PROG (PARI) a(n) = sum(k=0, n, binomial(5*k, n-k)); (PARI) my(N=30, x='x+O('x^N)); Vec(1/(1-x*(1+x)^5)) CROSSREFS Cf. A002478, A099234, A099235. Sequence in context: A022814 A000390 A000391 * A107660 A200665 A200466 Adjacent sequences: A360087 A360088 A360089 * A360091 A360092 A360093 KEYWORD nonn,easy AUTHOR Seiichi Manyama, Jan 25 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.

Last modified June 6 05:06 EDT 2023. Contains 363139 sequences. (Running on oeis4.)