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 A077121 #19 Apr 06 2025 08:45:41 %S A077121 1,2,3,6,9,12,15,19,23,28,32,37,42,47,53,59,65,71,77,83,90,97,104,111, %T A077121 118,126,133,141,149,157,165,173,182,190,199,208,217,226,235,244,253, %U A077121 263,273,282,292,302,312,323,333,344,354,365,375,386,397,408,420 %N A077121 Number of integer squares <= n^3. %C A077121 a(n) = number of terms in n-th row of A167222. - _Reinhard Zumkeller_, Oct 31 2009 %H A077121 Amiram Eldar, <a href="/A077121/b077121.txt">Table of n, a(n) for n = 0..10000</a> %F A077121 a(n) = floor(n^(3/2))+1 = A000093(n) + 1. %e A077121 Squares <= 3^3 = 27: 0, 1, 4, 9, 16 and 25, hence a(3) = 6. %t A077121 a[n_] := Floor[Sqrt[n^3]] + 1; Array[a, 100, 0] (* _Amiram Eldar_, Apr 06 2025 *) %o A077121 (Python) %o A077121 from math import isqrt %o A077121 def A077121(n): return isqrt(n**3)+1 # _Chai Wah Wu_, Sep 08 2024 %Y A077121 Cf. A000093, A065733, A077113, A167222, A167223. %K A077121 nonn,easy %O A077121 0,2 %A A077121 _Reinhard Zumkeller_, Oct 29 2002