Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006588
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006588 4^n*(3*n)!/((2*n)!*n!). +0
2
1, 12, 240, 5376, 126720, 3075072, 76038144, 1905131520, 48199827456, 1228623052800, 31504481648640, 811751838842880, 20999667135283200, 545086744471535616, 14189559697354260480, 370298578584748425216 (list; graph; listen)
OFFSET

0,2

REFERENCES

W. A. Whitworth, DCC Exercises in Choice and Chance, Stechert, NY, 1945, p. 35.

The right-hand side of a binomial coefficient identity in H. W. Gould, Combinatorial Identities, Morgantown, 1972; Eq. 3.115, page 35.

FORMULA

Sum_{k=0..n} binomial(4n+1, 2n-2k)*binomial(n+k, k) = 4^n*binomial(3n, n).

a(n) ~ 1/2*3^(1/2)*pi^(-1/2)*n^(-1/2)*3^(3*n)*{1 - 7/72*n^-1 + ...} - Joe Keane (jgk(AT)jgk.org), Jun 11 2002

MAPLE

A006588 := n->add( binomial(4*n+1, 2*n-2*k)*binomial(n+k, k), k=0..n);

MATHEMATICA

Table[4^n*(3*n)!/((2*n)!*n!), {n, 0, 20}] - Erich Friedman (efriedma(AT)stetson.edu), Mar 22 2008

PROGRAM

(PARI) f(n) = 4^n*(3*n)!/((2*n)!*n!) or g(n) = sum(k=0, n, binomial(4*n+1, 2*n-2*k)*binomial(n+k, k)) - P L Patodia (pannalal(AT)usa.net), Feb 24 2007

CROSSREFS

Sequence in context: A012303 A119837 A012538 this_sequence A009150 A009080 A002166

Adjacent sequences: A006585 A006586 A006587 this_sequence A006589 A006590 A006591

KEYWORD

nonn,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research