login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065737 Largest square <= binomial(n,2). 1
0, 1, 1, 4, 9, 9, 16, 25, 36, 36, 49, 64, 64, 81, 100, 100, 121, 144, 169, 169, 196, 225, 225, 256, 289, 324, 324, 361, 400, 400, 441, 484, 484, 529, 576, 625, 625, 676, 729, 729, 784, 841, 900, 900, 961, 1024, 1024, 1089, 1156, 1225 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

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

FORMULA

a(n) = A048760(binomial(n,2)).

MATHEMATICA

Floor[Sqrt[#]]^2&/@Binomial[Range[50], 2] (* Harvey P. Dale, Feb 28 2020 *)

PROG

(PARI) { for (n=1, 1000, a=sqrtint(binomial(n, 2))^2; write("b065737.txt", n, " ", a) ) } \\ Harry J. Smith, Oct 28 2009

CROSSREFS

Cf. A048760, A000217, A065730-A065741.

Sequence in context: A186887 A140978 A106410 * A014719 A139417 A329732

Adjacent sequences:  A065734 A065735 A065736 * A065738 A065739 A065740

KEYWORD

easy,nonn

AUTHOR

Labos Elemer, Nov 15 2001

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 7 16:00 EDT 2021. Contains 343652 sequences. (Running on oeis4.)