%I A060427
%S A060427 2,11,17,23,71,71,599,599,3011,27901,52163,778699,2374649,10428007
%N A060427 Smallest prime p such that there are n strings of consecutive integers 
               all having products = 1 mod p.
%H A060427 C. Rivera, <a href="http://www.primepuzzles.net/problems/prob_027.htm">
               Prime Puzzles</a>
%e A060427 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.
%Y A060427 Sequence in context: A133410 A156829 A105840 this_sequence A108894 A066794 
               A153222
%Y A060427 Adjacent sequences: A060424 A060425 A060426 this_sequence A060428 A060429 
               A060430
%K A060427 nonn,nice
%O A060427 1,1
%A A060427 Jason Earls (zevi_35711(AT)yahoo.com), Apr 05 2001
%E A060427 More terms from Jens Kruse Andersen (jens.k.a(AT)get2net.dk), May 04 
               2007