login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A117358
a(n) = A032742(A032742(A032742(n))) = ((n/lpf(n))/lpf(n/lpf(n)))/lpf((n/lpf(n))/lpf(n/lpf(n))), where lpf=A020639, least prime factor.
7
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 3, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 3, 1, 7, 1, 1, 1, 5, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 10, 3, 1, 1, 7, 1, 1, 1, 11, 1, 5, 1, 1, 1, 1, 1, 12, 1, 1, 1, 5, 1, 1, 1
OFFSET
1,16
LINKS
Eric Weisstein's World of Mathematics, Least Prime Factor
FORMULA
a(n) = A032742(A032742(A032742(n))) = A032742(A054576(n)) = A054576(n)/A115561(n).
a(A037144(n)) = 1, a(A033987(n)) > 1.
MATHEMATICA
f[n_] := n/FactorInteger[n][[1, 1]]; (* f is A032742 *)
a[n_] := f@ f@ f@ n;
Array[a, 100] (* Jean-François Alcover, Dec 09 2021 *)
Table[Nest[#/FactorInteger[#][[1, 1]]&, n, 3], {n, 110}] (* Harvey P. Dale, Oct 10 2024 *)
PROG
(Scheme) (define (A117358 n) (A032742 (A032742 (A032742 n)))) ;; Antti Karttunen, Dec 07 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Mar 10 2006
STATUS
approved