|
|
|
|
1, 1, 2, 2, 4, 2, 4, 4, 4, 8, 8, 16, 8, 8, 8, 16, 16, 16, 16, 32, 16, 32, 32, 32, 64, 32, 32, 32, 64, 64, 64, 64, 64, 64, 64, 128, 128, 256, 128, 128, 128, 128, 128, 128, 128, 256, 256, 256, 256, 256, 256, 512, 256, 256, 256, 512, 512, 512, 512, 1024, 512, 512, 512, 512
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MATHEMATICA
|
Do[If[IntegerQ[Log[2, EulerPhi[n]]], Print[n]; ta[[u]]=n; u=u+1], {n, 1, 10000}] EulerPhi[ta]
|
|
PROG
|
(PARI) for(n=1, 1000, my(i=eulerphi(n)); if(omega(2*i)==1, print1(i, “, “))) \\ Jianing Song, Sep 28 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|