19398320447domain: NAppears in sequencesa(n) is the smallest k such that prime(k+i) = 1 (mod 6) for i = 0, 1,...,n-1.at n=25A247816a(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=25A391807