This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A048762 #24 Aug 15 2022 04:31:01
%S A048762 0,1,1,1,1,1,1,1,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,27,27,27,27,27,
%T A048762 27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,
%U A048762 27,27,27,27,27,27,27,27,27,64,64,64
%N A048762 Largest cube <= n.
%D A048762 Krassimir T. Atanassov, On the 40th and 41st Smarandache Problems, Notes on Number Theory and Discrete Mathematics, Sophia, Bulgaria, Vol. 4, No. 3 (1998), 101-104.
%D A048762 J. Castillo, Other Smarandache Type Functions: Inferior/Superior Smarandache f-part of x, Smarandache Notions Journal, Vol. 10, No. 1-2-3 (1999), 202-204.
%H A048762 Reinhard Zumkeller, <a href="/A048762/b048762.txt">Table of n, a(n) for n = 0..10000</a>
%H A048762 Florentin Smarandache, <a href="http://www.gallup.unm.edu/~smarandache/OPNS.pdf">Only Problems, Not Solutions!</a>.
%H A048762 Krassimir T. Atanassov, <a href="http://www.gallup.unm.edu/~smarandache/Atanassov-SomeProblems.pdf">On Some of Smarandache's Problems</a>, American Research Press, 1999, 27-32.
%F A048762 Sum_{n>=1} 1/a(n)^2 = Pi^4/30 + Pi^6/945 + 3*zeta(5). - _Amiram Eldar_, Aug 15 2022
%p A048762 A048762 := proc(n)
%p A048762 floor(root[3](n)) ;
%p A048762 %^3 ;
%p A048762 end proc: # _R. J. Mathar_, Nov 06 2011
%t A048762 Floor[Surd[Range[0,70],3]]^3 (* _Harvey P. Dale_, Jun 23 2013 *)
%o A048762 (Haskell)
%o A048762 a048762 n = last $ takeWhile (<= n) a000578_list
%o A048762 -- _Reinhard Zumkeller_, Nov 28 2011
%Y A048762 Cf. A048763, A201053, A000578.
%K A048762 nonn
%O A048762 0,9
%A A048762 Charles T. Le (charlestle(AT)yahoo.com)