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!)
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)).
A081211(n) = A081213(n) iff a(n) <= 2; a(A131072(n)) > 2. - Reinhard Zumkeller, Jun 13 2007
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];
Table[a[n], {n, 1, 105}] (* Jean-François Alcover, Mar 27 2013, updated Nov 27 2023 *)
CROSSREFS
Sequence in context: A308470 A070140 A361561 * A280751 A280749 A321936
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Mar 10 2003
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 April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)