Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082759
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082759 a(n) = Sum[ binomial[n,k] trinomial[n,k], {k,0,n} ] where trinomial[n,k] = trinomial coefficients +0
6
1, 2, 8, 35, 160, 752, 3599, 17446, 85376, 420884, 2087008, 10398016, 52010479, 261021854, 1313707256, 6628095035, 33512880640, 169768235840, 861450392708, 4377796514152, 22277498220160, 113502759811000, 578931209245760 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n)=sum(k=0, n, C(n+k, n-k)*C(n, k)) - Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 20 2003

2*n*(2*n - 1)*(38*n - 53)*a(n) + ( - 760*n^3 + 1820*n^2 - 1252*n + 252)*a(n - 1) - 8*(n - 1)*(19*n^2 - 36*n + 9)*a(n - 2) - 3*(38*n - 15)*(n - 1)*(n - 2)*a(n - 3) = 0. - Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 15 2004

a(n)=sum{k=0..n, C(2n-k, k)*C(n, k)} - Paul Barry (pbarry(AT)wit.ie), Jan 20 2005

PROGRAM

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

CROSSREFS

Cf. A037011.

Sequence in context: A116618 A037723 A037618 this_sequence A137265 A129580 A007034

Adjacent sequences: A082756 A082757 A082758 this_sequence A082760 A082761 A082762

KEYWORD

easy,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research