Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005810
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005810 Binomial(4n,n).
(Formerly M3625)
+0
5
1, 4, 28, 220, 1820, 15504, 134596, 1184040, 10518300, 94143280, 847660528, 7669339132, 69668534468, 635013559600, 5804731963800, 53194089192720, 488526937079580, 4495151581425648, 41432089765583440, 382460951663844400 (list; graph; listen)
OFFSET

0,2

REFERENCES

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 828.

LINKS

T. D. Noe, Table of n, a(n) for n=0..100

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, December 1972 [alternative scanned copy].

FORMULA

a(n) is asymptotic to c*sqrt(n)*(256/27)^n with c= 0.46... - Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 26 2003

a(n) is asymptotic to c*(256/27)^n/sqrt(n) with c = sqrt(2 / (3 pi)) = 0.460658865961780639... - Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 26 2003; corrected by Charles R Greathouse IV, Dec 14 2006

CROSSREFS

Adjacent sequences: A005807 A005808 A005809 this_sequence A005811 A005812 A005813

Sequence in context: A130185 A026020 A026033 this_sequence A121203 A089023 A035610

KEYWORD

nonn,easy

AUTHOR

njas

EXTENSIONS

More terms from Henry Bottomley (se16(AT)btinternet.com), Oct 06 2000

Corrected by T. D. Noe, Jan 16 2007

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 October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research