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 A134034 #8 Mar 15 2023 10:50:05
%S A134034 2,1,1,2,2,1,1,2,2,1,2,2,2,2,1,3,3,1,3,1,2,3,2,4,1,2,4,1,4,3,1,4,1,3,
%T A134034 2,4,3,1,4,3,4,3,3,2,2,3,3,4,3,4,3,4,2,3,4,3,2,5,2,4,4,3,3,4,3,5,3,5,
%U A134034 4,4,1,4,4,4,3,4,6,3,2,2,3,7,3,6,2,5,4,7,2,3,5,5,3,4,3,5,4,3,3,6,5,3,5,6,3
%N A134034 Number of primes between n^K and (n+1)^K, where K is 1.647862393566467... and n is an integer greater than 0.
%C A134034 K is the smallest number such that there is always at least one prime between n^K and (n+1)^K for any integer n>0.
%C A134034 This is not the smallest K. See A143898. [_T. D. Noe_, Sep 04 2008]
%t A134034 k=1.647862393566467; Table[Length[Select[Range[Ceiling[n^k],Floor[(n+1)^k]], PrimeQ]], {n,150}] (* _T. D. Noe_, Sep 04 2008 *)
%Y A134034 Cf. A014085, A060715.
%K A134034 nonn
%O A134034 1,1
%A A134034 _Dmitry Kamenetsky_, Jan 11 2008
%E A134034 Corrected by _T. D. Noe_, Sep 04 2008