|
%I #38 Feb 18 2024 01:26:08
%S 1,1,1,2,1,2,1,1,2,1,1,2,1,1,1,3,1,1,1,3,2,1,1,3,2,1,1,3,2,1,1,1,3,2,
%T 1,1,1,3,2,1,1,1,1,3,2,1,1,1,1,3,2,1,1,1,1,4,2,1,1,1,1,4,2,1,1,1,1,1,
%U 4,2,1,1,1,1,1
%N Parameters of Chebyshev function psi.
%C a(x,n) is the exponent k such that prime(n)^k <= x and x < prime(n)^(k+1).
%C psi(x) = Sum_{p_n <= x} k*log(p_n), where a(x,n) = k is the unique integer such that p_n^k <= x but p_n^(k+1) > x.
%C Related to Firoozbakht's Conjecture (1982): p_n^(1/n) > p_(n+1)^(1/(n+1)) for all n >= 1.
%H N. Kanti Sinha, <a href="https://arxiv.org/abs/1010.1399">On a new property of primes that leads to a generalization of Cramer's conjecture</a>, arXiv:1010.1399 [math.NT], 2010.
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Chebyshev_function#Relationships">Chebyshev function</a>
%e If x = 7, then 2^2, 3^1, 5^1, 7^1 <= x < 2^3, 3^2, 5^2, 7^2, respectively so k = 2, 1, 1, 1, respectively.
%e The table starts in row x=2 with columns n >= 1 as:
%e 1;
%e 1, 1;
%e 2, 1;
%e 2, 1, 1;
%e 2, 1, 1;
%e 2, 1, 1, 1;
%e 3, 1, 1, 1;
%e 3, 2, 1, 1;
%e 3, 2, 1, 1, 1;
%t A206722[x_, n_] := Module[{p = Prime[n]}, For[k = 0, True, k++, If[p^(k+1) > x && p^k <= x, Return[k]]]];
%t Table[DeleteCases[Table[A206722[x, n], {n, 1, 17}], 0], {x, 2, 20}] // Flatten (* _Jean-François Alcover_, Sep 15 2018, after _R. J. Mathar_ *)
%o (Maxima)
%o prime(n) := block(
%o if n = 1 then
%o return(2)
%o else
%o return(next_prime(prime(n-1)))
%o )$ /* very slow recursive definition of A000040 */
%o A206722(x,n) := block(
%o local(p),
%o p : prime ( n ),
%o for k : 0 do (
%o if p^(k+1) > x and p^k <= x then
%o return(k)
%o )
%o )$
%o for x : 2 thru 20 do (
%o for n : 1 thru 17 do
%o sprint(A206722(x,n)),
%o newline()
%o )$ /* _R. J. Mathar_, Feb 14 2012 */
%Y Columns: A000523 (n=1), A062153 (n=2).
%K nonn,tabf,easy
%O 2,4
%A _John W. Nicholson_, Feb 11 2012
|
