50021
domain: N
Properties
Primality
- Prime
- yes
Appears in sequences
- Numbers where k-th digit from right is either 0 or k.at n=19A063013
- Engel expansion of Sum_{k>=0} 1/(4 + k)^k.at n=10A063187
- Smallest prime in which the n-th significant digit is a 5.at n=4A069592
- Smallest n-digit prime beginning with n.at n=3A077504
- Smallest n-digit number beginning with n and having prime signature of n, or 0 if no such number exists.at n=4A086558
- Smallest prime beginning with prime(n) and having as many digits.at n=2A090927
- Primes in increasing order with most significant digit following the cyclic pattern 2,3,5,7,2,3,5,7,2,3,5,7,...at n=18A113611
- Number of (n+4) X 8 0..1 matrices with each 5 X 5 subblock idempotent.at n=17A224686
- Primes that are the sum of the squares of three integers that form an arithmetic sequence with difference 7.at n=13A227994
- Number T(n,k) of equivalence classes of ways of placing k 2 X 2 tiles in an n X n square under all symmetry operations of the square; irregular triangle T(n,k), n>=2, 0<=k<=floor(n/2)^2, read by rows.at n=39A236679
- Consider a number n with m decimal digits. The sequence lists the numbers n having the suffix of length m-1 in the middle of the decimal expansion of prime(n).at n=44A242957
- Primes p such that 2*prime(p) + 1 = prime(q) for some prime q.at n=45A261361
- Least prime p = prime(n)^2 + prime(n+1)^2 + prime(n+2)^2 + prime(n+3)^2 + q^2, where q > prime(n+3) is also prime.at n=22A263724
- Number of non-equivalent ways to place 5 non-attacking kings on an n X n board.at n=6A279114
- Expansion of e.g.f. exp(x*G(x)^2) where G(x) = 1 + x*G(x)^4 is the g.f. of A002293.at n=5A380514
- Prime numbersat n=5134