This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A249275 a(n) = smallest base b > 1 such that p = prime(n) satisfies b^(p-1) == 1 (mod p^3). 4
 9, 26, 57, 18, 124, 239, 158, 333, 42, 1215, 513, 691, 1172, 3038, 295, 1468, 2511, 15458, 3859, 6372, 923, 1523, 5436, 1148, 412, 4943, 4432, 5573, 476, 68, 21304, 30422, 6021, 8881, 33731, 25667, 3868, 3170, 17987, 26626, 43588, 7296, 14628, 22076, 138057 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(n) >= A039678(n) for all n. LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..100 MATHEMATICA Array[Block[{b = 2}, While[PowerMod[b, # - 1, #^3] != 1, b++]; b] &@ Prime@ # &, 45] (* Michael De Vlieger, Nov 25 2018 *) dpa[n_]:=Module[{p=Prime[n], a=9}, While[PowerMod[a, p - 1, p^3]!=1, a++]; a]; Array[dpa, 50] (* Vincenzo Librandi, Nov 30 2018 *) PROG (PARI) forprime(p=1, 1e3, my(b=2); while(Mod(b, p^3)^(p-1)!=1, b++); print1(b, ", "); ) CROSSREFS Cf. A039678, A242742. Sequence in context: A081267 A052153 A154560 * A270695 A048468 A255108 Adjacent sequences:  A249272 A249273 A249274 * A249276 A249277 A249278 KEYWORD nonn AUTHOR Felix Fröhlich, Oct 24 2014 EXTENSIONS Edited by Felix Fröhlich, Nov 24 2018 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.

Last modified August 25 09:11 EDT 2019. Contains 326323 sequences. (Running on oeis4.)