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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073943 a(n) = smallest m such that n-th prime divides m^m + 1. 1
1, 5, 2, 3, 21, 6, 24, 27, 11, 14, 15, 6, 25, 63, 23, 26, 117, 30, 99, 35, 9, 39, 165, 11, 6, 10, 51, 213, 54, 7, 63, 261, 174, 23, 74, 33, 78, 27, 83, 86, 357, 30, 95, 12, 14, 11, 15, 111, 453, 18, 12, 119, 90, 501, 4, 131, 82, 135, 117, 60, 45, 138, 51, 95, 54, 114, 75 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Harvey P. Dale, Table of n, a(n) for n = 1..1000

EXAMPLE

6th prime is 13 and 13 first divides 6^6 + 1 = 46657, so a(6) = 6.

MATHEMATICA

smp[n_]:=Module[{m=1}, While[PowerMod[m, m, n]!=n-1, m++]; m]; smp/@Prime[ Range[ 70]] (* Harvey P. Dale, Jul 21 2018 *)

CROSSREFS

Cf. A014566.

Sequence in context: A105269 A248262 A291690 * A193797 A214662 A277581

Adjacent sequences:  A073940 A073941 A073942 * A073944 A073945 A073946

KEYWORD

easy,nonn

AUTHOR

Jason Earls, Nov 13 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 20 02:34 EST 2019. Contains 329323 sequences. (Running on oeis4.)