Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071168
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071168 n-th prime reduced modulo Phi[n]. +0
2
0, 0, 1, 1, 3, 1, 5, 3, 5, 1, 1, 1, 5, 1, 7, 5, 11, 1, 13, 7, 1, 9, 17, 1, 17, 5, 13, 11, 25, 1, 7, 3, 17, 11, 5, 7, 13, 1, 23, 13, 19, 1, 23, 13, 5, 1, 27, 15, 17, 9, 9, 23, 33, 17, 17, 23, 17, 19, 45, 9, 43, 23, 19, 23, 25, 17, 1, 17, 39, 13, 3, 23, 7, 13, 19, 23, 29, 13, 11, 25, 41 (list; graph; listen)
OFFSET

1,5

FORMULA

a(n)=Mod[Prime[n], EulerPhi[n]]=Mod[A000040(n), A000010(n)].

MATHEMATICA

Table[Mod[Prime[w], EulerPhi[w]], {w, 1, 128}]

CROSSREFS

Cf. A000040, A000010, A066936, A071169.

Sequence in context: A092099 A096567 A076363 this_sequence A091926 A109606 A127418

Adjacent sequences: A071165 A071166 A071167 this_sequence A071169 A071170 A071171

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), May 15 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 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research