The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A090407 a(n) = Sum_{k = 0..n} C(4*n + 1, 4*k). 4
 1, 6, 136, 2016, 32896, 523776, 8390656, 134209536, 2147516416, 34359607296, 549756338176, 8796090925056, 140737496743936, 2251799780130816, 36028797153181696, 576460751766552576, 9223372039002259456 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Harvey P. Dale, Table of n, a(n) for n = 0..800 Index entries for linear recurrences with constant coefficients, signature (12,64). FORMULA From Harvey P. Dale, Jan 19 2012: (Start) a(0) = 1, a(1) = 6, a(n) = 12*a(n-1)+64*a(n-2). G.f.: (6*x-1)/(64*x^2+12*x-1). (End) a(n) = (1/2) * 4^n * (4^n + (-1)^n). - Peter Bala, Feb 06 2019 MATHEMATICA Table[Sum[Binomial[4n+1, 4k], {k, 0, n}], {n, 0, 30}] (* or *) LinearRecurrence[ {12, 64}, {1, 6}, 30] (* Harvey P. Dale, Jan 19 2012 *) CROSSREFS Cf. A070775, A001025, A090408, A038503. Sequence in context: A196703 A196852 A196946 * A222915 A245104 A075185 Adjacent sequences:  A090404 A090405 A090406 * A090408 A090409 A090410 KEYWORD easy,nonn AUTHOR Paul Barry, Nov 29 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 21 04:10 EDT 2021. Contains 347596 sequences. (Running on oeis4.)