|
%I #56 Mar 28 2020 17:37:45
%S 0,4,3,3,6,7,6,6,3,9,1,18,11,12,21,3,10,33,31,32,24,8,13,32,35,4,15,9,
%T 15,26,22,24,9,3,14,55,36,3,65,52,33,139,42,2,85,25,7,96,16,33
%N Number of solutions x to n * pi(x) = x, where pi(x) = number of primes <= x.
%C Equivalently, a(n) is number of solutions x to the equation pi(n*x) = x. - _Farideh Firoozbakht_, Jan 09 2005 [For example, a(2) = 4 because 1, 2, 3 & 4 are all solutions of pi(2*x) = x and a(11) = 1 because 15927 is the only solution of the equation pi(11*x) = x.]
%C S. W. Golomb proved that a(n) > 0 for each integer n > 1. - _Carlo Sanna_, Nov 09 2015
%H S. W. Golomb, <a href="http://www.jstor.org/stable/2312732">On the ratio of N to π(N)</a>, The American Mathematical Monthly, Vol. 69, No. 1 (Jan 1962), pp. 36-37.
%H Robert T. Harger and William L. Hightower, <a href="http://www.jstor.org/stable/25653721">An Interesting Property of x/π(x)</a>, The College Mathematics Journal Vol. 40, No. 3 (May 2009), pp. 213-214.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PrimeCountingFunction.html">Prime Counting Function.</a>
%e 11*pi(x) = x has only 1 solution, so a(11) = 1.
%t (* Assumes upper and lower bounds are as defined in A038626. *)
%t xmin = .5; xmax = 2;
%t Join[{0},Table[c = 0; x = Floor[2.4*xmin]; x1 = 2.7*xmax + 7;
%t xmin = Infinity; xmax = 0; While[x <= x1,
%t If[x == PrimePi[n x], c++; xmin = Min[x, xmin];
%t xmax = Max[x, xmax]]; x++]; c, {n, 2, 15}]] (* _Robert Price_, Mar 28 2020 *)
%Y Cf. A038623, A038624, A038625, A038626, A102281, A087237.
%K nonn,more
%O 1,2
%A _Jud McCranie_
%E One more term from _Labos Elemer_, Sep 05 2003
%E a(24)-a(26) from _Labos Elemer_, Sep 12 2003
%E Edited by _N. J. A. Sloane_, Sep 06 2008 at the suggestion of _R. J. Mathar_
%E a(27)-a(29) from _David Radcliffe_, Sep 10 2014
%E a(29) corrected and a(30)-a(50) obtained from the A038625 values computed by _Jan Büthe_. - _Giovanni Resta_, Aug 31 2018
|
