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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A139469 a(n) = Sum_{k=0..n} C(n,3k+2)^2. 4
0, 0, 1, 9, 36, 101, 261, 882, 3921, 17253, 67554, 243695, 876789, 3324906, 13166791, 52301709, 203824548, 782913717, 3010327497, 11695756698, 45823049817, 179787741723, 703527078258, 2747647985241, 10739885115573, 42082084255050, 165225573240651 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

The recurrence is same as for A119363. - Vaclav Kotesovec, Mar 12 2019

LINKS

Seiichi Manyama, Table of n, a(n) for n = 0..1000

FORMULA

a(n) ~ 4^n / (3*sqrt(Pi*n)). - Vaclav Kotesovec, Mar 12 2019

MATHEMATICA

Table[Sum[Binomial[n, 3*k + 2]^2, {k, 0, n}], {n, 0, 40}] (* Vaclav Kotesovec, Mar 12 2019 *)

PROG

(PARI) a(n) = sum(k=0, n, binomial(n, 3*k+2)^2); \\ Michel Marcus, Mar 12 2019

(MAGMA) [&+[Binomial(n, 3*k+2)^2: k in [0..n]]: n in [0..30]]; // Vincenzo Librandi, Mar 14 2019

CROSSREFS

Cf. A024495, A119363, A139468.

Sequence in context: A000537 A114286 A098928 * A103158 A298442 A212104

Adjacent sequences:  A139466 A139467 A139468 * A139470 A139471 A139472

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Jun 12 2008

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 29 01:37 EST 2020. Contains 331328 sequences. (Running on oeis4.)