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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082758 Sum of the squares of the trinomial coefficients (A027907). 5
1, 3, 19, 141, 1107, 8953, 73789, 616227, 5196627, 44152809, 377379369, 3241135527, 27948336381, 241813226151, 2098240353907, 18252025766941, 159114492071763, 1389754816243449, 12159131877715993, 106542797484006471 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

a(n) = T(2*n,2*n), the coefficient of x^(2*n) in (1+x+x^2)^(2*n), where T is the trinomial triangle A027907; Integral representation : a(n) = 1/Pi * Integral[(1+2*x)^(2*n)/Sqrt[1-x^2],{x,-1, 1}], i.e. a(n) is the moment of order 2n of the random variable 1+2X, where the distribution of X is an arcsin law on the interval (-1,1). - Nour-Eddine Fahssi (fahssin(AT)yahoo.fr), Jan 22 2008

FORMULA

a(n) = sum(k=0..2*n+1, T(n, k)^2 ) where T(n, k) are trinomial coefficients (A027907).

a(n)=sum(k=0, n, binomial(2*n-k, k)*binomial(2*n, k)) - Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 30 2003

G.f.: (1/sqrt(1+2*x-3*x^2)+1/sqrt(1-2*x-3*x^2))/2 (with interpolated zeros) - Paul Barry, Jan 04 2005

a(n)=sum{k=0..n, C(2*n,2*k)*C(2*k,k)}=sum{k=0..n, C(n+k,2k)*C(2*n,n+k)}; [From Paul, Dec 16 2008]

MATHEMATICA

Table[Sum[(-1)^(i)*Binomial[2*n, i]*Binomial[4*n-3*i-1, 2*n-3*i], {i, 0, 2*n/3}], {n, 0, 25}] (* From Adi Dani, Jul 03 2011 *)

PROG

(PARI) a(n)={local(v=Vec((1+x+x^2)^n)); sum(k=1, #v, v[k]^2); }

(PARI) a(n)=sum(k=0, n, binomial(2*n-k, k)*binomial(2*n, k));

(Maxima) makelist(sum(binomial(2*n-k, k)*binomial(2*n, k), k, 0, n), n, 0, 40);

CROSSREFS

Bisection of A002426.

Sequence in context: A074559 A027314 A025571 * A110525 A058859 A095002

Adjacent sequences:  A082755 A082756 A082757 * A082759 A082760 A082761

KEYWORD

easy,nonn

AUTHOR

Emanuele Munarini (munarini(AT)mate.polimi.it), May 21 2003

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 15 17:40 EST 2012. Contains 205828 sequences.