Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066685
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066685 Numbers n such that p(n) is congruent to EulerPhi(n) mod n, where p(n) denotes the n-th prime. +0
1
1, 2, 3, 789, 40087, 238717, 251737 (list; graph; listen)
OFFSET

1,2

EXAMPLE

p(3) = 5 is congruent to sigma(3) = 2 mod 3; so 3 is a term of the sequence.

MATHEMATICA

Select[ Range[ 1, 10^6 ], Mod[ EulerPhi[ # ], # ] == Mod[ Prime[ # ], # ] & ]

CROSSREFS

Sequence in context: A090510 A004887 A108332 this_sequence A076155 A004898 A062920

Adjacent sequences: A066682 A066683 A066684 this_sequence A066686 A066687 A066688

KEYWORD

nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Jan 11 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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research