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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A067732 Numbers n such that phi(prime(n)+1)==0 (mod n). 0
1, 2, 4, 6, 8, 24, 36, 48, 80, 192, 1440, 3960, 5184, 5478, 6480, 16080, 20336, 29628, 40073, 40083, 43056, 44980, 85800, 200320, 241920, 252378, 258048, 287040, 697248, 1805672, 3669120, 3713787, 3927600, 4321143, 4448880, 6928128 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

MATHEMATICA

Do[ If[ Mod[ EulerPhi[ Prime[n] + 1], n] == 0, Print[n]], {n, 1, 10^7} ]

CROSSREFS

Sequence in context: A189153 A194393 A119260 * A117912 A092047 A057809

Adjacent sequences:  A067729 A067730 A067731 * A067733 A067734 A067735

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 05 2002

EXTENSIONS

Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 07 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 16 20:14 EST 2012. Contains 205962 sequences.