36767

Properties

Appears in sequences

• n*10^3-1, n*10^3-3, n*10^3-7 and n*10^3-9 are all prime.at n=19A064977
• a(1) = 1, a(2) = 2; a(n+1) = 2n*a(n) - a(n-1). Symmetrically, a(n) = (a(n-1) + a(n+1))/((n-1) + (n+1)).at n=6A093985
• Primes of the form Sum_{k=1..n} phi(prime(k)).at n=21A101302
• Consecutive pairs of prime point sums in A161191 (includes triples).at n=23A161192
• Odd primes of the form (1+n)*(2+2*n)+n*(3+2*n) = 4*n^2+7*n+2.at n=25A171749
• Minimal order of degree-n irreducible polynomials over GF(29).at n=30A218364
• Primes of the form 15*k^2 - 15*k + 17.at n=34A220081
• Primes p such that 1000p-1, 1000p-3, 1000p-7 and 1000p-9 are all prime.at n=3A243410
• Primes formed by an m-digit prime concatenated with its last (m-1) digits, for m > 1.at n=19A252667
• Primes having only {3, 6, 7} as digits.at n=35A260380
• Number of multisets of nonempty words with a total of n letters over binary alphabet containing the second letter such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=12A293797
• a(n) is the smallest prime p such that there is a multiplicative subgroup H of Z/pZ, of odd order and of index 2n, such that for any two cosets H1 and H2 of H, H1 + H2 contains all of (Z/pZ)\0, except that H+H contains all of (Z/pZ)\0 except -H. If no such prime exists, a(n) = 0.at n=30A294615
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where A(n,k) is Sum_{j=0..floor(n/2)} ((n-j)!/j!)*binomial(n-j,j)*k^(n-2*j)*(-1)^j.at n=42A305466
• Primes prime(k) such that (prime(k), prime(k+1)), (prime(k+2), prime(k+3)), (prime(k+4), prime(k+5)) form a triangle of area 2.at n=31A308649
• Prime numbersat n=3898