Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069809
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069809 GCD(n,phi(n))=tau(n). +0
1
1, 8, 9, 18, 24, 40, 56, 84, 88, 104, 136, 152, 156, 184, 228, 232, 248, 296, 328, 344, 360, 372, 376, 424, 444, 472, 488, 516, 536, 568, 584, 632, 664, 712, 732, 776, 792, 804, 808, 824, 856, 872, 876, 904, 948, 1016, 1048, 1096, 1112, 1164, 1192, 1208 (list; graph; listen)
OFFSET

1,2

PROGRAM

(PARI) for(n=1, 1592, if(gcd(n, eulerphi(n))==numdiv(n), print1(n, ", ")))

CROSSREFS

Sequence in context: A057104 A095191 A050706 this_sequence A067544 A022313 A120311

Adjacent sequences: A069806 A069807 A069808 this_sequence A069810 A069811 A069812

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 30 2002

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 September 7 12:28 EDT 2008. Contains 143483 sequences.


AT&T Labs Research