Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096769
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096769 a(n)=Max{ (i+j)!/i!^2 | 0<=i,j<=n }. +0
1
1, 2, 6, 30, 180, 1260, 10080, 100800, 1108800, 13305600, 172972800, 2421619200, 36324288000, 617512896000, 11115232128000, 211189410432000, 4223788208640000, 88699552381440000, 1951390152391680000 (list; graph; listen)
OFFSET

1,2

COMMENT

Max{ (i+j)!/i!/j! | 0<=i,j<=n }=binomial(2n,n)

FORMULA

Partial products of A000037. - Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 17 2004

CROSSREFS

Sequence in context: A009422 A057221 A127115 this_sequence A111059 A009645 A112385

Adjacent sequences: A096766 A096767 A096768 this_sequence A096770 A096771 A096772

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), May 30 2002

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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research