118801
domain: N
Properties
Primality
- Prime
- yes
Appears in sequences
- a(n) is the smallest start of a run of exactly n+1 consecutive primes with n (not necessarily equal) prime differences, each divisible by 6.at n=6A054203
- First of n consecutive primes which differ by a multiple of 6.at n=7A054679
- First prime starting a chain of exactly n consecutive primes congruent to 1 modulo 6.at n=7A055625
- Initial prime in first sequence of n consecutive primes congruent to 1 modulo 6.at n=7A057620
- Primes having only {0, 1, 8} as digits.at n=31A061247
- Smallest prime such that n*k(n)^2+n*k(n)+1 is a prime > (n-1)*k(n-1)^2+(n-1)*k(n-1)+1 with k(n)>1 or 0 if n=4 as no prime possible.at n=39A104995
- Primes whose digit reversal is a triangular number.at n=22A115705
- Numerator of Hermite(n, 1/20).at n=4A159657
- Primes p of the form |prime(n+2)^2-prime(n+1)^2-prime(n)^2|, (absolute values).at n=30A176134
- Primes consisting of all of the cube digits (i.e., 0, 1 and 8) at least once.at n=18A180685
- Primes of the form 3*m^2 - 2.at n=31A201715
- Least prime in a string of exactly n consecutive primes all differing by 3-almost primes (A014612).at n=6A226768
- Primes p such that the 3 X 3 matrix with components (row by row) prime(k+m), 0 <= m <= 8 has zero determinant, where p = prime(k).at n=15A337160
- Array read by downward antidiagonals: for m >= 3 and n >= 1, T(m,n) is the first prime that starts a string of exactly n consecutive primes that are congruent (mod m).at n=28A359272
- a(n) = prime(A391807(n)).at n=7A390511
- Prime numbersat n=11199