The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #7 Dec 15 2017 17:34:58
%S 2,11,17,23,71,71,599,599,3011,27901,52163,778699,2374649,10428007
%N Smallest prime p such that there are n strings of consecutive integers all having products = 1 mod p.
%H C. Rivera, <a href="http://www.primepuzzles.net/problems/prob_027.htm">Prime Puzzles</a>
%e 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.
%K nonn,nice
%O 1,1
%A _Jason Earls_, Apr 05 2001
%E More terms from _Jens Kruse Andersen_, May 04 2007