OFFSET
1,2
COMMENTS
Powers of 2 arise at the end of iterations without interruption. Analogous to A053035.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Michael De Vlieger)
FORMULA
a(n) = A049113(n!). - R. J. Mathar, Jan 09 2017
EXAMPLE
For n = 10, the initial value is 10! = 3628800 and the iteration chain is {3628800, 829440, 221184, 73728, 24576, 8192, 4096, 2048, 1024, 512, 256, 128, 64, 32, 16, 8, 4, 2, 1}. Its length is 19 and 14 values are powers of 2: 8192, ..., 1. Thus a(10) = 14.
MAPLE
A053045 := proc(n)
local a, e;
e := n! ;
a :=0 ;
while e > 1 do
if isA000079(e) then
a := a+1 ;
end if;
e := numtheory[phi](e) ;
end do:
1+a;
end proc:
seq(A053045(n), n=1..18) ; # R. J. Mathar, Jan 09 2017
MATHEMATICA
Table[Count[NestWhileList[EulerPhi, n!, # > 1 &], _?(IntegerQ@ Log2@ # &)], {n, 63}] (* Michael De Vlieger, Aug 15 2017 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Labos Elemer, Feb 25 2000
STATUS
approved