39500857

Appears in sequences

• First i such that gcd(prime(i)+1, prime(i+1)+1, ..., prime(i+n)+1) > 2.at n=19A111038
• First i such that gcd(prime(i)+1, prime(i+1)+1, ..., prime(i+n)+1) > 2.at n=20A111038
• a(n) is the smallest k such that prime(k+i) (mod 6) takes successively the values 5, 5, ... for i = 0, 1, ..., n-1.at n=20A247967
• a(n) is the smallest k such that prime(k+i) (mod 6) takes successively the values 5, 5, ... for i = 0, 1, ..., n-1.at n=21A247967
• Index of the first prime which starts a run of n consecutive primes all congruent to each other mod 3 (or mod 6).at n=20A276414
• Index of the first prime which starts a run of n consecutive primes all congruent to each other mod 3 (or mod 6).at n=21A276414
• a(n) is the least k such that the residues mod 3 of the primes prime(k), prime(k+1), ... comprise a string of n 2's followed by 1.at n=21A391796