|
Search: id:A065737
|
|
|
| A065737 |
|
Largest square <= Binomial[n,2]. |
|
+0
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; listen)
|
|
|
OFFSET
|
1,4
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
FORMULA
|
a(n)=A048760[C[n, 2]]
|
|
PROGRAM
|
(PARI) { for (n=1, 1000, a=sqrtint(binomial(n, 2))^2; write("b065737.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 28 2009]
|
|
CROSSREFS
|
Cf. A048760, A000217, A065730-A065741
Sequence in context: A100555 A140978 A106410 this_sequence A014719 A139417 A095873
Adjacent sequences: A065734 A065735 A065736 this_sequence A065738 A065739 A065740
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Nov 15 2001
|
|
|
Search completed in 0.004 seconds
|
