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!)
A065733 Largest square <= n^3. 16

%I #24 Dec 05 2022 12:01:36

%S 0,1,4,25,64,121,196,324,484,729,961,1296,1681,2116,2704,3364,4096,

%T 4900,5776,6724,7921,9216,10609,12100,13689,15625,17424,19600,21904,

%U 24336,26896,29584,32761,35721,39204,42849,46656,50625,54756,59049,63504

%N Largest square <= n^3.

%C a(n) + A077116(n) = n^3.

%H Harry J. Smith, <a href="/A065733/b065733.txt">Table of n, a(n) for n = 0..1000</a>

%F a(n) = A048760(n^3).

%F n^3 - 2*n^(3/2) <= a(n) <= n^3. - _Charles R Greathouse IV_, Dec 05 2022

%e a(10)=961, as 961=31^2 is the largest square <= 1000 = 10^3.

%t Table[Floor[Sqrt[w^3]//N]^2, {w, 1, 50}]

%o (PARI) for (n=0, 1000, a=sqrtint(n^3)^2; write("b065733.txt", n, " ", a)) \\ _Harry J. Smith_, Oct 28 2009

%o (PARI) A065733(n)=sqrtint(n^3)^2 \\ _M. F. Hasler_, Oct 05 2013

%o (Haskell) a065733 n = head [x | x <- reverse [0.. n^3], a010052 x == 1] -- _Reinhard Zumkeller_, Oct 10 2013

%Y Cf. A048760, A000093, A065730-A065741, A087285.

%Y Cf. A077115, A077116, A077118, A077121.

%K easy,nonn

%O 0,3

%A _Labos Elemer_, Nov 15 2001

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 27 23:22 EDT 2024. Contains 372020 sequences. (Running on oeis4.)