login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090939 Least multiple of n == -1 (mod prime(n)). 2
1, 2, 9, 20, 10, 12, 84, 56, 45, 260, 154, 36, 286, 42, 375, 688, 884, 792, 133, 780, 1386, 1342, 414, 1512, 775, 1716, 1647, 1176, 435, 1920, 2666, 1440, 2739, 3196, 595, 4680, 5180, 1140, 5343, 6400, 1968, 2352, 6493, 2508, 1575, 8556, 9494, 6912, 4312, 4350 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..50.

MATHEMATICA

m[n_]:=Module[{i=1, p}, p=Prime[n]; While[Mod[n i, p]!=p-1, i++]; i n]

Table[m[i], {i, 50}] (* Harvey P. Dale, Nov 19 2010 *)

CROSSREFS

Cf. A090938.

Sequence in context: A026541 A038249 A116014 * A077338 A047883 A042915

Adjacent sequences:  A090936 A090937 A090938 * A090940 A090941 A090942

KEYWORD

nonn

AUTHOR

Amarnath Murthy, Dec 29 2003

EXTENSIONS

More terms from Ray Chandler, Jan 01 2004

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 28 14:34 EDT 2022. Contains 354115 sequences. (Running on oeis4.)