login
This site is supported by donations to The OEIS Foundation.

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094269 a[n] = phi[A003401]. 0
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

LINKS

Table of n, a(n) for n=1..64.

MATHEMATICA

Do[If[IntegerQ[Log[2, EulerPhi[n]]], Print[n]; ta[[u]]=n; u=u+1], {n, 1, 10000}] EulerPhi[ta]

CROSSREFS

Cf. A000010, A003401.

Sequence in context: A057936 A033097 A036845 * A157227 A054536 A001316

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 | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified July 29 10:58 EDT 2014. Contains 245021 sequences.