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 A191291 #14 Mar 22 2023 17:41:08
%S A191291 0,0,0,1,1,1,1,0,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,3,3,2,2,2,2,2,2,2,2,
%T A191291 2,3,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,
%U A191291 4,4,4,4,4,4,4,4,4,4,4,4,5,5
%N A191291 The number of bases >=2 in which n is 3-digit number.
%F A191291 a(n) = floor(sqrt(n))-floor(n^(1/3)) = A000196(n) - A048766(n).
%t A191291 Table[Floor[Sqrt[n]]-Floor[CubeRoot[n]],{n,90}] (* _Harvey P. Dale_, Mar 22 2023 *)
%o A191291 (PARI) a(n)=sqrtint(n)-floor((n+.5)^(1/3)) \\ _Charles R Greathouse IV_, Jan 03 2013
%Y A191291 Cf. A191279.
%K A191291 nonn,easy,base
%O A191291 1,16
%A A191291 _Vladimir Shevelev_, May 29 2011