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!)
A060427 Smallest prime p such that there are n strings of consecutive integers all having products = 1 mod p. 0
2, 11, 17, 23, 71, 71, 599, 599, 3011, 27901, 52163, 778699, 2374649, 10428007 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
C. Rivera, Prime Puzzles
EXAMPLE
For n = 2 we have 3*4 = 5*6*7 = 1 mod 11. For n = 3 we have 2*3*4*5 = 6*7*8*9*10*11 = 12*13*14*15 = 1 mod 17.
CROSSREFS
Sequence in context: A336368 A282509 A225590 * A108894 A233445 A066794
KEYWORD
nonn,nice
AUTHOR
Jason Earls, Apr 05 2001
EXTENSIONS
More terms from Jens Kruse Andersen, May 04 2007
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 April 23 23:26 EDT 2024. Contains 371917 sequences. (Running on oeis4.)