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 A077113 #31 Aug 16 2025 03:20:59
%S A077113 1,2,2,3,3,3,4,4,5,5,5,5,6,6,6,7,7,7,7,8,8,8,8,9,9,9,9,10,10,10,10,10,
%T A077113 11,11,11,11,11,12,12,12,12,12,13,13,13,13,13,14,14,14,14,14,14,15,15,
%U A077113 15,15,15,15,16,16,16,16,16,17,17,17,17,17,17,17,18,18,18,18,18,18,19
%N A077113 Number of nonnegative integer cubes <= n^2.
%C A077113 a(n) is the least number m such that m^3 > n^2. - _Zak Seidov_, May 03 2005
%H A077113 Amiram Eldar, <a href="/A077113/b077113.txt">Table of n, a(n) for n = 0..10000</a>
%F A077113 a(n) = floor(n^(2/3))+1.
%F A077113 a(n) = [x^(n^2)] (1/(1 - x))*Sum_{k>=0} x^(k^3). - _Ilya Gutkovskiy_, Apr 20 2018
%F A077113 a(n) = A100196(n) + 1. - _Amiram Eldar_, Apr 05 2025
%e A077113 Cubes <= 10^2: 0, 1, 8, 27 and 64, hence a(10) = 5.
%t A077113 Table[Floor[n^(2/3) + 1], {n, 0, 100}] (* _Zak Seidov_, May 03 2005 *)
%o A077113 (Python)
%o A077113 from sympy import integer_nthroot
%o A077113 def A077113(n): return integer_nthroot(n**2,3)[0]+1 # _Chai Wah Wu_, Aug 15 2025
%Y A077113 Cf. A026409, A026414, A054071, A077106, A077121, A100196.
%K A077113 nonn,easy
%O A077113 0,2
%A A077113 _Reinhard Zumkeller_, Oct 29 2002
%E A077113 Edited by _N. J. A. Sloane_, Aug 29 2008 at the suggestion of _R. J. Mathar_