|
%I #21 Sep 10 2023 09:47:50
%S 0,2,3,5,4,11,13,6,19,23,29,10,8,41,43,14,53,59,61,15,12,22,79,83,89,
%T 26,21,103,107,109,25,34,16,18,139,38,151,33,163,167,173,35,181,191,
%U 28,197,199,211,223,58,229,233,24,30,27,51,49,269,55,277,281,74
%N The pi-based antiderivative of n: the least m such that A258851(m) equals n.
%H Alois P. Heinz, <a href="/A258861/b258861.txt">Table of n, a(n) for n = 0..10000</a>
%F a(n) = min { m >= 0 : A258851(m) = n }.
%F A258851(a(n)) = n.
%F a(n) <= A000040(n) for n>0.
%p with(numtheory):
%p d:= n-> n*add(i[2]*pi(i[1])/i[1], i=ifactors(n)[2]):
%p a:= proc() local t, a; t, a:= -1, proc() -1 end;
%p proc(n) local h;
%p while a(n) = -1 do
%p t:= t+1; h:= d(t);
%p if a(h) = -1 then a(h):= t fi
%p od; a(n)
%p end
%p end():
%p seq(a(n), n=0..100);
%t A258851[n_] := If[n == 0, 0, n*Total[Last[#]*PrimePi[First[#]]/First[#]& /@ FactorInteger[n]]];
%t a[n_] := For[m = 0, True, m++, If[A258851[m] == n, Return[m]]];
%t Table[a[n], {n, 0, 100}] (* _Jean-François Alcover_, Sep 10 2023 *)
%Y Column k=1 of A259016, A259153.
%Y Cf. A000040, A000720, A258851, A258862, A258995.
%K nonn
%O 0,2
%A _Alois P. Heinz_, Jun 12 2015
|
