login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065738 Largest square <= binomial(2n,n). 1

%I #9 Jun 17 2018 03:42:21

%S 1,4,16,64,225,900,3364,12769,48400,184041,703921,2702736,10394176,

%T 40106889,155102116,601034256,2333566249,9075039169,35345128009,

%U 137845868176,538256995600,2104098203601,8233427666025,32247599617809

%N Largest square <= binomial(2n,n).

%H Harry J. Smith, <a href="/A065738/b065738.txt">Table of n, a(n) for n = 1..200</a>

%F a(n) = A048760(A000984(n)).

%o (PARI) { for (n=1, 200, a=sqrtint(binomial(2*n, n))^2; write("b065738.txt", n, " ", a) ) } \\ _Harry J. Smith_, Oct 29 2009

%Y Cf. A048760, A000984, A065730-A065741.

%K easy,nonn

%O 1,2

%A _Labos Elemer_, Nov 15 2001

%E Terms corrected and extended by _Harry J. Smith_, Oct 29 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 18:15 EDT 2024. Contains 371962 sequences. (Running on oeis4.)