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

%I #10 Mar 24 2014 02:06:51

%S 1,2,9,20,10,12,84,56,45,260,154,36,286,42,375,688,884,792,133,780,

%T 1386,1342,414,1512,775,1716,1647,1176,435,1920,2666,1440,2739,3196,

%U 595,4680,5180,1140,5343,6400,1968,2352,6493,2508,1575,8556,9494,6912,4312,4350

%N Least multiple of n == -1 (mod prime(n)).

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

%t Table[m[i],{i,50}] (* _Harvey P. Dale_, Nov 19 2010 *)

%Y Cf. A090938.

%K nonn

%O 1,2

%A _Amarnath Murthy_, Dec 29 2003

%E More terms from _Ray Chandler_, Jan 01 2004

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 April 18 02:22 EDT 2024. Contains 371767 sequences. (Running on oeis4.)