login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A024719 a(n) = (1/3)*(2 + sum of C(3k,k)) for k = 0,1,2,...,n. 0
1, 2, 7, 35, 200, 1201, 7389, 46149, 291306, 1853581, 11868586, 76380826, 493606726, 3201081874, 20821158234, 135776966762, 887393271311, 5811082966886, 38119865826421, 250447855600321, 1647729357535486 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

FORMULA

a(n)=sum{k=0..n, C(k-n,2n-2k)}. [From Paul Barry (pbarry(AT)wit.ie), Mar 15 2010]

G.f.: (1-2*g)/((3*g-1)*(g^3-2*g^2+g-1)) where g*(1-g)^2 = x. - Mark van Hoeij, Nov 09 2011

MAPLE

a:=n->(sum((binomial(-j, -3*j)), j=0..n)): seq(a(n), n=0..20); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 03 2007

CROSSREFS

Sequence in context: A057298 A058941 A020066 * A086637 A172511 A130458

Adjacent sequences:  A024716 A024717 A024718 * A024720 A024721 A024722

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), May 01 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 16:29 EST 2012. Contains 205635 sequences.