This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A245085 Maximal t in [2, prime(n)-1] such that all the smallest positive residues of 2!,3!,...,t! modulo prime(n) are distinct. 2
 4, 5, 3, 8, 5, 4, 7, 5, 9, 12, 6, 10, 9, 11, 4, 15, 7, 8, 7, 13, 18, 9, 18, 13, 17, 9, 10, 10, 23, 11, 11, 18, 17, 17, 18, 21, 15, 14, 28, 13, 26, 36, 8, 13, 32, 22, 16, 6, 24, 15, 22, 28, 21, 15, 28, 16, 42, 23, 32, 25, 8, 20, 18, 20, 33, 26, 10, 35, 14, 5, 29 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,1 COMMENTS a(n) = prime(n)-1, if A247190(n)=0; else a(n) = m-1, where m is defined in A247190. See comments in A247190. LINKS Peter J. C. Moses and Chai Wah Wu, Table of n, a(n) for n = 3..10002 First 1000 terms from Peter J. C. Moses. FORMULA a(n) >= A247190(n). MATHEMATICA Table[ans={}; NestWhile[#+1&, 2, (AppendTo[ans, Mod[#!, Prime[n]]]; (Length[ans]

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 October 21 03:24 EDT 2019. Contains 328291 sequences. (Running on oeis4.)