26947

Properties

Appears in sequences

• Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4,2,6]; short d-string notation of pattern = [426].at n=15A078850
• Primes which remain prime after one and after two applications of the rotate-and-add operation of A086002.at n=21A086003
• Primes p such that the number of primes less than p equal to 1 mod 4 is one less than the number of primes less than p equal to 3 mod 4.at n=24A096448
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 1, 1), (1, -1, 0), (1, 1, -1)}.at n=9A148987
• Primes p such that 4*p and 6*p are each the sum of two consecutive primes.at n=39A164133
• Primes p such that 2*p^3-+15 are also prime.at n=35A174364
• Let p_(4,3)(m) be the m-th prime == 3 (mod 4). Then a(n) is the smallest p_(4,3)(m) such that the interval(p_(4,3)(m)*n, p_(4,3)(m+1)*n) contains exactly one prime == 3(mod 4).at n=47A210476
• Number of compositions of n having exactly two fixed points.at n=15A240737
• Primes p = prime(k) such that 0 = Sum_{j=1..k} T(k, j) where T(n, k) = K(prime(n), prime(k)) * K(prime(k), prime(n)) and K is the Kronecker symbol.at n=16A373225
• For a line L in the plane, let C(L) denote the number of prime points [k, prime(k)] on L, and let M(L) denote the maximum prime(k) of any of these points; a(n) = minimum M(L) over all lines with C(L) >= n.at n=33A376188
• For a line L in the plane, let C(L) denote the number of prime points [k, prime(k)] on L, and let M(L) denote the maximum prime(k) of any of these points; a(n) = minimum M(L) over all lines with C(L) >= n.at n=34A376188
• For a line L in the plane, let C(L) denote the number of prime points [k, prime(k)] on L, and let M(L) denote the maximum prime(k) of any of these points; a(n) = minimum M(L) over all lines with C(L) >= n.at n=35A376188
• For a line L in the plane, let C(L) denote the number of prime points [k, prime(k)] on L, and let M(L) denote the maximum prime(k) of any of these points; a(n) = minimum M(L) over all lines with C(L) >= n.at n=36A376188
• For a line L in the plane, let C(L) denote the number of prime points [k, prime(k)] on L, and let M(L) denote the maximum prime(k) of any of these points; a(n) = minimum M(L) over all lines with C(L) >= n.at n=37A376188
• For a line L in the plane, let C(L) denote the number of prime points [k, prime(k)] on L, and let M(L) denote the maximum prime(k) of any of these points; a(n) = minimum M(L) over all lines with C(L) >= n.at n=38A376188
• For a line L in the plane, let C(L) denote the number of prime points [k, prime(k)] on L, and let M(L) denote the maximum prime(k) of any of these points; a(n) = minimum M(L) over all lines with C(L) >= n.at n=39A376188
• For a line L in the plane, let C(L) denote the number of prime points [k, prime(k)] on L, and let M(L) denote the maximum prime(k) of any of these points; a(n) = minimum M(L) over all lines with C(L) >= n.at n=40A376188
• For a line L in the plane, let C(L) denote the number of prime points [k, prime(k)] on L, and let M(L) denote the maximum prime(k) of any of these points; a(n) = minimum M(L) over all lines with C(L) >= n.at n=41A376188
• For a line L in the plane, let C(L) denote the number of prime points [k, prime(k)] on L, and let M(L) denote the maximum prime(k) of any of these points; a(n) = minimum M(L) over all lines with C(L) >= n.at n=42A376188
• For a line L in the plane, let C(L) denote the number of prime points [k, prime(k)] on L, and let M(L) denote the maximum prime(k) of any of these points; a(n) = minimum M(L) over all lines with C(L) >= n.at n=43A376188