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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A090938 Least multiple of n == 1 (mod prime(n)). 3
 1, 4, 6, 8, 45, 66, 35, 96, 162, 30, 187, 408, 247, 560, 330, 160, 119, 306, 1140, 640, 147, 396, 1495, 624, 1650, 910, 1134, 1820, 2726, 1470, 1271, 2752, 1782, 1530, 4620, 756, 629, 5054, 1170, 520, 5371, 5250, 1720, 5984, 7290, 598, 423, 3792, 6811, 7100 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 MATHEMATICA mn1[n_]:=Module[{k=1, pn=Prime[n]}, While[Mod[k n, pn]!=1, k++]; k n]; Array[mn1, 50] (* Harvey P. Dale, May 12 2012 *) CROSSREFS Cf. A090939. Sequence in context: A019161 A291718 A137026 * A058229 A087271 A067797 Adjacent sequences: A090935 A090936 A090937 * A090939 A090940 A090941 KEYWORD nonn AUTHOR Amarnath Murthy, Dec 29 2003 EXTENSIONS Corrected and extended by 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.

Last modified April 14 12:23 EDT 2024. Contains 371661 sequences. (Running on oeis4.)