|
|
A184968
|
|
Smallest k such that phi(phi(k)) = 2^n.
|
|
1
|
|
|
5, 11, 17, 41, 85, 137, 257, 641, 1285, 2329, 4369, 10537, 17477, 35209, 65537, 163841, 297109, 557057, 1114129, 2687017, 4491589, 8978569, 16843009, 42009217, 71304257, 143163649, 286331153, 690563369, 1145390149, 2281701377, 4295098369, 10737647617
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Phi is Euler's function.
|
|
LINKS
|
|
|
EXAMPLE
|
a(5) = 85 because phi(85) = 64, phi(64) = 2^5.
|
|
MAPLE
|
with(numtheory):for n from 1 to 22 do: id:=0:for k from 1 to 10000000 while(id=0)
do: if phi(phi(k)) =2^n then id:=1:print(k):else fi:od:od:
# Alternative:
f:= proc(n) local S, s, r;
uses numtheory;
S:= sort(convert(invphi(2^n), list));
r:= infinity;
for s in S while s < r do
r:= min(r, min(invphi(s)))
od;
r
end proc:
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|