804584

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=13A080373
• 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=14A080373
• 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=15A080373
• 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=14A080380
• Number of n X 6 0..1 arrays with every row having the same least squares slope fit to a straight line, and every column the same least squares slope fit to a straight line, with a single point array taken as having zero slope.at n=8A223590
• 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=13A363016
• 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=14A363016
• 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=15A363016