1857276773

Appears in sequences

• a(n) is the smallest number k such that GCD of n values of prime(j)-1 for successive j values starting with k is greater than 2.at n=24A080373
• a(n) is the smallest k such that prime(k+i) = 1 (mod 6) for i = 0, 1,...,n-1.at n=23A247816
• a(n) is the smallest k such that prime(k+i) = 1 (mod 6) for i = 0, 1,...,n-1.at n=24A247816
• a(n) is the least k such that the residues mod 3 of the primes prime(k), prime(k+1),... include a string of n 1's followed by 2.at n=24A391807