|
| |
|
|
A065730
|
|
Largest square <= n-th prime.
|
|
12
| |
|
|
1, 1, 4, 4, 9, 9, 16, 16, 16, 25, 25, 36, 36, 36, 36, 49, 49, 49, 64, 64, 64, 64, 81, 81, 81, 100, 100, 100, 100, 100, 121, 121, 121, 121, 144, 144, 144, 144, 144, 169, 169, 169, 169, 169, 196, 196, 196, 196, 225, 225, 225, 225, 225, 225, 256, 256, 256, 256, 256
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
|
FORMULA
| a(n)=A048760[A000040(n)]
|
|
|
PROG
| (PARI) { for (n=1, 1000, a=sqrtint(prime(n))^2; write("b065730.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 28 2009]
|
|
|
CROSSREFS
| Cf. A048760, A000040, A065731-A065741
Sequence in context: A168280 A162564 A014694 * A168039 A145445 A008794
Adjacent sequences: A065727 A065728 A065729 * A065731 A065732 A065733
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Labos E. (labos(AT)ana.sote.hu), Nov 15 2001
|
| |
|
|
