40433

Properties

Appears in sequences

• Integers that can be expressed as the sum of consecutive primes in exactly 5 ways.at n=13A055000
• Primes expressible as the sum of (at least two) consecutive primes in at least 4 ways.at n=10A067380
• Primes p such that the polynomial x^5-x^4-x^3-x^2-x-1 mod p has 5 distinct zeros.at n=31A106281
• Primes p such that q-p = 26, where q is the next prime after p.at n=28A124594
• Numbers k such that binomial(5k, k) + 1 is prime.at n=16A125243
• Prime numbers p for which quintonacci quintic polynomial x^5-x^4-x^3-x^2-x-1 modulus p is completely factorizable.at n=32A135846
• Prime numbers p not of the form 10k+1 for which the quintonacci quintic polynomial x^5 - x^4 - x^3 - x^2 - x - 1 modulus p is factorizable into five binomials.at n=26A135847
• a(n) = 28*n^2 + 1.at n=38A158556
• a(n) = the smallest positive integer that, when written in binary, contains both binary n and binary n^2 as substrings.at n=38A165820
• Primes having only {0, 3, 4} as digits.at n=14A199340
• Primes of the form 7n^2 + 1.at n=19A201602
• Primes p such that each decimal digit of p is equal to the difference of two other digits of p.at n=30A255892
• Triangle read by rows: T(n,k) number of ways of partitioning the (n+4)-element multiset {1,1,1,1,1,2,3,...,n} into exactly k nonempty parts, n >= 0 and 1 <= k <= n + 4.at n=65A291119
• 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=33A308649
• a(n) = 1 + Sum_{i=1..n} (-1)^i * Product_{j=1..i} floor(n/j).at n=16A331213
• Primes p such that neither g-1 nor g+1 is prime, where g is the gap from p to the next prime.at n=42A355485
• a(n) = Sum_{d|n} (d-1)! * d^(n/d).at n=7A358279
• G.f. A(x) satisfies A(x) = 1 + x*(1 + x)^2*A(x)^3.at n=7A366221
• Primes having only {0, 3, 4, 5} as digits.at n=34A386056
• Primes having only {0, 3, 4, 6} as digits.at n=31A386057