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”).

A092694
Product of iterated phi(n).
4
1, 1, 2, 2, 8, 2, 12, 8, 12, 8, 80, 8, 96, 12, 64, 64, 1024, 12, 216, 64, 96, 80, 1760, 64, 1280, 96, 216, 96, 2688, 64, 1920, 1024, 1280, 1024, 1536, 96, 3456, 216, 1536, 1024, 40960, 96, 4032, 1280, 1536, 1760, 80960, 1024, 4032, 1280, 32768, 1536, 79872, 216
OFFSET
1,3
COMMENTS
A logarithmic plot of this sequence shows an unusual banded structure.
LINKS
FORMULA
a(1) = 1, a(n) = phi(n) * a(phi(n))
EXAMPLE
a(100) = 40960 because the iterations of phi (40, 16, 8, 4, 2, 1) have a product of 40960.
MATHEMATICA
nMax=100; a=Table[1, {nMax}]; Do[e=EulerPhi[n]; a[[n]]=e*a[[e]], {n, 2, nMax}]; a
PROG
(Haskell)
a092694 n = snd $ until ((== 1) . fst) f (a000010 n, 1) where
f (x, p) = (a000010 x, p * x)
-- Reinhard Zumkeller, Jan 30 2014
(Python)
from sympy import totient
from math import prod
def f(n):
m = n
while m > 1:
m = totient(m)
yield m
def A092694(n): return prod(f(n)) # Chai Wah Wu, Nov 14 2021
CROSSREFS
Cf. A003434 (iterations of phi(n) needed to reach 1), A092693 (iterated phi sum).
Cf. A000010.
Sequence in context: A011147 A273168 A098818 * A098984 A088560 A222821
KEYWORD
nonn,look
AUTHOR
T. D. Noe, Mar 04 2004
STATUS
approved