56307979

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=19A080373
• 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=20A080373
• 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=21A080373
• 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=22A080373
• 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=23A080373
• Least n such that n consecutive values in A080378 equal 0; i.e., exactly n differences between consecutive primes are divisible by 4.at n=22A080380
• a(n) is the least integer k such that the k-th, (k+1)-th, ..., (k+n-1)-th primes are congruent to 1 mod 4.at n=19A363016
• a(n) is the least integer k such that the k-th, (k+1)-th, ..., (k+n-1)-th primes are congruent to 1 mod 4.at n=20A363016
• a(n) is the least integer k such that the k-th, (k+1)-th, ..., (k+n-1)-th primes are congruent to 1 mod 4.at n=21A363016
• a(n) is the least integer k such that the k-th, (k+1)-th, ..., (k+n-1)-th primes are congruent to 1 mod 4.at n=22A363016
• a(n) is the least integer k such that the k-th, (k+1)-th, ..., (k+n-1)-th primes are congruent to 1 mod 4.at n=23A363016