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 A106626 #4 Mar 30 2012 18:40:01
%S A106626 4,5,5,4,4,7,7,5,5,6,6,10,8,6,7,7,7,7,7,13,10,8,8,8,8,9,8,9,9,16,11,9,
%T A106626 9,10,10,9,10,10,10,11,10,19,13,10,11,11,11,12,11,11,12,11,12,12,12,
%U A106626 22,14,12,12,13,12,13,12,13,13,13,13,13,13,14,13,25,16,13,14,14,14,14,14,14
%N A106626 Count value of k in A104758.
%C A106626 A104758: the number of cubes m = k^3 such that n <= m <= (n+1)^2.
%t A106626 f[n_] := Floor[(n + 1)^(2/3)] - Floor[n^(1/3)] + If[ IntegerQ[n^(1/3)], 1, 0]; t = Table[ f[n], {n, 0, 867}]; Count[t, # ] & /@ Range[81]
%Y A106626 Cf. A104758.
%K A106626 nonn
%O A106626 1,1
%A A106626 _Giovanni Teofilatto_ and _Robert G. Wilson v_, May 10 2005