|
|
A081212
|
|
Let r(n,k) = if k=0 then n else r(A081210(n),k-1), then a(n) = Min{i:r(n,i) = r(n,i+1)}.
|
|
6
|
|
|
0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 2, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 2, 1, 1, 0, 1, 0, 2, 0, 2, 0, 0, 0, 2, 0, 0, 2, 1, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 1, 1, 0, 0, 0, 2, 1, 0, 0, 3, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,12
|
|
COMMENTS
|
Number of times A081210 is to be applied to n until a fixed-point is reached, A081213(n)=r(n,a(n)).
|
|
LINKS
|
|
|
MATHEMATICA
|
gsf[n_] := For[k = n, True, k--, If[SquareFreeQ[k], Return[k]]];
A081210[n_] := Times @@ gsf /@ Power @@@ FactorInteger[n];
a[n_] := Module[{cnt = 0}, FixedPoint[(cnt++; A081210[#])&, n]; cnt-1];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|