This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A094269 a(n) = phi(A003401(n)). 1
 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 All terms are powers of 2. - Jianing Song, Sep 28 2018 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 Cf. A000010, A003401. Sequence in context: A057936 A033097 A036845 * A157227 A054536 A293664 Adjacent sequences:  A094266 A094267 A094268 * A094270 A094271 A094272 KEYWORD nonn AUTHOR Labos Elemer, Jun 02 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 18 11:36 EDT 2019. Contains 325138 sequences. (Running on oeis4.)