The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A258995 Third pi-based antiderivative of n: the least m such that A258851^3(m) equals n. 6
0, 5, 11, 10, 4, 29, 35, 41, 14, 431, 599, 78, 15, 38, 201, 191, 25, 382, 186, 43, 19, 65, 94, 3001, 535, 22, 42, 633, 317, 4397, 21, 141, 8, 74, 574, 214, 1286, 61, 253, 247, 1417, 163, 115, 217, 66, 546, 138, 10631, 1997, 51, 12097, 12301, 362, 26, 563, 1013 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = min { m >= 0 : A258851^3(m) = n }.
A258851^3(a(n)) = A258853(a(n)) = n.
a(n) <= A000040^3(n) for n>0.
a(n) <= A258861^3(n).
MAPLE
with(numtheory):
d:= n-> n*add(i[2]*pi(i[1])/i[1], i=ifactors(n)[2]):
a:= proc() local t, a; t, a:= -1, proc() -1 end;
proc(n) local h;
while a(n) = -1 do
t:= t+1; h:= d(d(d(t)));
if a(h) = -1 then a(h):= t fi
od; a(n)
end
end():
seq(a(n), n=0..100);
MATHEMATICA
d[n_] := d[n] = If[n == 0, 0, n*Total[Last[#]*PrimePi[First[#]]/First[#] & /@ FactorInteger[n]]];
A[n_, k_] := For[m = 0, True, m++, If[Nest[d, m, k] == n, Return[m]]];
a[n_] := A[n, 3];
Table[a[n], {n, 0, 100}] (* Jean-François Alcover, May 17 2024 *)
CROSSREFS
Column k=3 of A259016.
Sequence in context: A254766 A185201 A112956 * A335554 A157801 A061768
KEYWORD
nonn,changed
AUTHOR
Alois P. Heinz, Jun 16 2015
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 21 00:58 EDT 2024. Contains 372720 sequences. (Running on oeis4.)