22003

Properties

Appears in sequences

• T(n, 2*n-3), T given by A027960.at n=48A027965
• a[n] is the 5th term in Euclid-Mullin (EM) prime sequence initiated with n-th prime.at n=43A094461
• Evaluate n^4 - 93n^3 + 3196n^2 - 48008n + 265483 for n >= 0, record the primes.at n=10A095974
• Primes p for which Sum_{1 <= n < p} (n!|p) == 0 (mod p), where (n!|p) is the Legendre symbol.at n=35A131652
• a(n) = 15*n^2 + 9*n + 1.at n=38A134153
• Primes congruent to 43 mod 61.at n=39A142841
• Primes p such that continued fraction of (1 + sqrt(p))/2 has period 6: primes in A146331.at n=24A146351
• Primes of the form 9*k^2-10*k+3.at n=13A154261
• a(n) = (n^4 + 16*n^3 + 65*n^2 + 26*n + 12)/12.at n=19A188480
• Primes whose base-7 representation also is the base-3 representation of a prime.at n=26A235470
• Prime numbers P such that 8*P^2-1 and 8*(8*P^2-1)^2-1 are also prime numbers.at n=35A245674
• Numbers that require three steps to collapse to a single digit in base 4 (written in base 4).at n=14A253953
• Primes having only {0, 2, 3} as digits.at n=15A260125
• Numbers k such that replacing each digit d in the decimal expansion of k with d^3 yields a prime each time, when done recursively three times.at n=13A316982
• Lexicographically earliest sequence of distinct prime terms such that the English names of the entries form the sequence A000040 (the prime numbers). See how in the Comments section.at n=2A345713
• Lexicographically earliest sequence of prime terms such that the English names of the entries form the sequence A000040 (the prime numbers). See how in the Comments section.at n=2A345880
• Start with a(1)=2; to get a(n+1) insert in a(n) the smallest possible digit at the rightmost possible position such that the new number is a prime.at n=4A357436
• Primes having only {0, 2, 3, 4} as digits.at n=26A386041
• Primes having only {0, 2, 3, 5} as digits.at n=33A386042
• Primes having only {0, 2, 3, 6} as digits.at n=25A386043