|
|
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
|
|
|
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
|
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|