40609

Properties

Appears in sequences

• a(n) = a(n-1)+ a(round(2*(n-1)/3)) +a(round((n-1)/3)) starting a(1)=1.at n=40A033498
• Primes with 22 as smallest positive primitive root.at n=9A061334
• Primes having only 0,4,6,8,9 as digits.at n=37A061372
• Consider the array T(n, m) = m-th prime of the form n*i(i+1)/2 +/- 1. This sequence is the main diagonal.at n=35A125765
• Primes of the form 2*n^2+6*n+1.at n=22A176549
• a(n) = 1+2*(d1 + 1)*(d2 + 1)*...*(dk + 1), where d1, d2, ..., dk are the prime factors of the n-th Fermat pseudoprime to base 2 A001567(n).at n=35A216646
• Number of free triangular n-polyplets (triangular polyominoes connected at edges or corners), where turning over is allowed and holes are allowed.at n=7A239658
• Prime numbers such that, in base 10, all their proper prefixes and suffixes represent composites.at n=29A254754
• Primes that are palindromic in factorial base.at n=23A333421
• Primes p such that if q is the next prime, p+A004086(q) and q+A004086(p) are prime.at n=42A351728
• Smallest prime p such that x^n - x - 1 splits modulo p.at n=6A377496
• Primes having only {0, 4, 6, 9} as digits.at n=19A386073
• Prime numbersat n=4257