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 A035936 #31 Jan 15 2021 06:08:58
%S A035936 1,1,3,3,3,3,4,4,5,4,5,5,5,6,6,6,6,6,6,7,7,7,7,7,8,7,8,8,8,8,8,9,8,9,
%T A035936 9,9,9,9,9,9,10,10,9,10,10,10,11,10,11,10,11,10,11,11,11,12,11,11,12,
%U A035936 11,12,12,12,12,12,12,12,12,13,12,13,12,13,13,13,13,13,13,14,13,14,13,14
%N A035936 Number of squares in (n^3, (n+1)^3 ].
%C A035936 There are never exactly two squares between two consecutive cubes. - _Vladimir Pletser_, Jan 12 2021
%H A035936 Vladimir Pletser, <a href="/A035936/b035936.txt">Table of n, a(n) for n = 0..10000</a>
%F A035936 a(n) = A000093(n+1)-A000093(n) (first differences of A000093). - _Henry Bottomley_, Aug 31 2000
%e A035936 a(3)=3 since 3^3 < 6^2, 7^2, 8^2 <= 4^3.
%p A035936 for n from 0 to 10000 do print(n, floor((n+1)^(3/2))-floor(n^(3/2))) end do; # _Vladimir Pletser_, Jan 11 2021
%t A035936 With[{sqs=Range[800]^2},Table[Count[sqs,_?(#>n^3&& #<=(n+1)^3&)],{n,0,85}]] (* _Harvey P. Dale_, Apr 12 2011 *)
%Y A035936 Cf. A000093, A000290 (squares), A000578 (cubes).
%K A035936 easy,nonn
%O A035936 0,3
%A A035936 _Erich Friedman_