Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A094269
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A094269 a[n] = phi[A003401]. +0
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; listen)
OFFSET

1,3

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 this_sequence A157227 A054536 A001316

Adjacent sequences: A094266 A094267 A094268 this_sequence A094270 A094271 A094272

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jun 02 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research