Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067732
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A067732
%S A067732 1,2,4,6,8,24,36,48,80,192,1440,3960,5184,5478,6480,16080,20336,29628,
%T A067732 40073,40083,43056,44980,85800,200320,241920,252378,258048,287040,
%U A067732 697248,1805672,3669120,3713787,3927600,4321143,4448880,6928128
%N A067732 Numbers n such that phi(prime(n)+1)==0 (mod n).
%t A067732 Do[ If[ Mod[ EulerPhi[ Prime[n] + 1], n] == 0, Print[n]], {n, 1, 10^7} 
               ]
%Y A067732 Sequence in context: A029951 A062287 A119260 this_sequence A117912 A092047 
               A057809
%Y A067732 Adjacent sequences: A067729 A067730 A067731 this_sequence A067733 A067734 
               A067735
%K A067732 nonn
%O A067732 1,2
%A A067732 Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 05 2002
%E A067732 Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 07 
               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 December 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research