|
| |
|
|
A065733
|
|
Largest square <= n^3.
|
|
14
| |
|
|
0, 1, 4, 25, 64, 121, 196, 324, 484, 729, 961, 1296, 1681, 2116, 2704, 3364, 4096, 4900, 5776, 6724, 7921, 9216, 10609, 12100, 13689, 15625, 17424, 19600, 21904, 24336, 26896, 29584, 32761, 35721, 39204, 42849, 46656, 50625, 54756, 59049, 63504
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| a(n) + A077116(n) = n^3.
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=0,...,1000
|
|
|
FORMULA
| a(n)=A048760[A000578(n)]=A048760[n^3]
|
|
|
EXAMPLE
| a(10)=961, as 961=31^2 is the largest square <= 1000=10^3.
|
|
|
MATHEMATICA
| Table[Floor[Sqrt[w^3]//N]^2, {w, 1, 50}]
|
|
|
PROG
| (PARI) { for (n=0, 1000, a=sqrtint(n^3)^2; write("b065733.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 28 2009]
|
|
|
CROSSREFS
| Cf. A048760, A000578, A065730-A065741, A087285.
Cf. A000290, A000578, A077115, A077116, A077118, A077121.
Sequence in context: A135784 A131069 A016790 * A077205 A180569 A125309
Adjacent sequences: A065730 A065731 A065732 * A065734 A065735 A065736
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Labos E. (labos(AT)ana.sote.hu), Nov 15 2001
|
| |
|
|
