|
%I #12 Jul 25 2019 08:40:57
%S 1,1,1,1,1,1,1,1,1,1,2,1,2,1,1,1,1,1,2,1,2,1,2,1,2,1,2,1,2,1,1,1,1,2,
%T 2,1,4,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,4,1,2,3,2,1,2,1,2,1,1,3,1,1,3,1,
%U 2,1,2,1,2,1,2,3,2,1,2,1,2,1,2,1,2,3
%N a(n) is the distance between n and the nearest prime power (in the sense of A246655) other than n.
%D S. M. Gonek, A formula of Landau and mean values of Zeta(s), Topics in Analytic Number Theory, ed. by S. W. Graham and J. D. Vaaler, 92-97, Univ. Texas Press 1985.
%D S. M. Gonek, An explicit formula of Landau and its applications to the theory of the zeta-function, Contemporary Math. 143 (1993), 395-413.
%H Peter Luschny, <a href="/A316190/b316190.txt">Table of n, a(n) for n = 1..10000</a>
%H E. Landau, <a href="https://eudml.org/doc/158549">Über die Nullstellen der Zetafunktion</a>, Math. Annalen 71, 548-564, (1911).
%e Note that 1369, 1373, 1381 and 1399 are prime powers. This leads to the mapping:
%e 1373 -> 4,
%e 1374 -> 1,
%e 1375 -> 2,
%e 1376 -> 3,
%e 1377 -> 4,
%e 1378 -> 3,
%e 1379 -> 2,
%e 1380 -> 1,
%e 1381 -> 8.
%p A316190_list := proc(N) local a, b, d, m, k, P, R; R := NULL; m := 1;
%p P := select(t -> nops(numtheory:-factorset(t)) = 1 or t = 0, [$0..N]);
%p for k from 1 to nops(P)-1 do
%p a := P[k]; b := P[k+1];
%p if m = a then
%p R := R, min(m - P[k-1] , b - m);
%p m := m + 1;
%p fi;
%p while m < b do
%p R := R, min(m - a , b - m);
%p m := m + 1;
%p od;
%p od; [R] end:
%p A316190_list(100);
%t a[n_] := Module[{k = 1}, While[!PrimePowerQ[n+k] && !PrimePowerQ[n-k], k++]; k]; Array[a, 100] (* _Jean-François Alcover_, Jul 25 2019 *)
%Y Cf. A246655, A316191.
%K nonn
%O 1,11
%A _Peter Luschny_, Jun 26 2018
|
