Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A065738
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A065738 Largest square <= Binomial[2n,n]. +0
1
1, 4, 16, 64, 225, 900, 3364, 12769, 48400, 184041, 703921, 2702736, 10394176, 40106889, 155102116, 601034256, 2333566249, 9075039169, 35345128009, 137845868176, 538256995600, 2104098203601, 8233427666025, 32247599617809 (list; graph; listen)
OFFSET

1,2

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,200

FORMULA

a(n)=A048760[A000984(n)]

PROGRAM

(PARI) { for (n=1, 200, a=sqrtint(binomial(2*n, n))^2; write("b065738.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 29 2009]

CROSSREFS

Cf. A048760, A000984, A065730-A065741

Sequence in context: A029993 A158988 A027676 this_sequence A006811 A005755 A077821

Adjacent sequences: A065735 A065736 A065737 this_sequence A065739 A065740 A065741

KEYWORD

easy,nonn,new

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Nov 15 2001

EXTENSIONS

Terms corrected and extended by Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 29 2009

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 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research