|
|
A080373
|
|
a(n) is the smallest number such that GCD of n values of prime(j)-1 for successive j values is greater than 2, where prime(j)=j-th prime.
|
|
0
|
|
|
0, 6, 24, 77, 271, 271, 1395, 1395, 1395, 13717, 34369, 172146, 172146, 804584, 804584, 804584
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
a(n) = Min{x; gcd[prime(x)-1, ..., prime(x+n-1)]>2}, where prime()=A000040().
|
|
EXAMPLE
|
n=3: a(3)=24 means: firstly occurs that for three consecutive p-1 terms GCD[prime(24)-1, prime(25)-1, prime(26)-1] = GCD[88, 96, 100] = 4 > 2;
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|