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 A262462 #31 Aug 21 2024 12:43:25
%S A262462 1,2,3,14,1122
%N A262462 Positive integers k with pi(k^3) a square, where pi(x) denotes the number of primes not exceeding x.
%C A262462 Conjecture: (i) The Diophantine equation pi(x^2) = y^2 with x > 0 and y > 0 has infinitely many solutions.
%C A262462 (ii) The only solutions to the Diophantine equation pi(x^m) = y^n with {m,n} = {2,3}, x > 0 and y > 0 are as follows:
%C A262462 pi(89^2) = 10^3, pi(2^3) = 2^2, pi(3^3) = 3^2, pi(14^3) = 20^2 and pi(1122^3) = 8401^2.
%C A262462 (iii) For m > 1 and n > 1 with m + n > 5, the equation pi(x^m) = y^n with x > 0 and y > 0 has no integral solution.
%C A262462 The conjecture seems reasonable in view of the heuristic arguments.
%C A262462 Part (ii) of the conjecture implies that the only terms of the current sequence are 1, 2, 3, 14 and 1122.
%e A262462 a(1) = 1 since pi(1^3) = 0^2.
%e A262462 a(2) = 2 since pi(2^3) = 2^2.
%e A262462 a(3) = 3 since pi(3^3) = 3^2.
%e A262462 a(4) = 14 since pi(14^3) = pi(2744) = 400 = 20^2.
%e A262462 a(5) = 1122 since pi(1122^3) = pi(1412467848) = 70576801 = 8401^2.
%t A262462 SQ[n_]:=IntegerQ[Sqrt[n]]
%t A262462 f[n_]:=PrimePi[n^3]
%t A262462 n=0;Do[If[SQ[f[k]],n=n+1;Print[n," ",k]],{k,1,1200}]
%t A262462 Select[Range[1200],IntegerQ[Sqrt[PrimePi[#^3]]]&] (* _Harvey P. Dale_, Aug 21 2024 *)
%Y A262462 Cf. A000290, A000578, A000720, A064523, A262408, A262409, A262443.
%K A262462 nonn,more
%O A262462 1,2
%A A262462 _Zhi-Wei Sun_, Sep 23 2015