27211

Properties

Appears in sequences

• [e^n]-th prime.at n=8A055739
• Primes p such that the next prime after p can be obtained from p by adding the product of the digits of p.at n=15A089823
• Numbers n such that (n + prime(n)), (n+1 + prime(n+1)), (n+2 + prime(n+2)) and (n+3 + prime(n+3)) are divisible by 5.at n=16A107582
• Primes p such that q-p = 28, where q is the next prime after p.at n=22A124595
• Numbers n such that 2^n divided by the number of digits of 2^n is an integer.at n=46A158520
• Number of ordered triples (w,x,y) with all terms in {1,...,n} and 2w^2>x^2+y^2.at n=38A211810
• Primes p such that (p+nextprime(p))/2 is a perfect square.at n=23A225195
• Primes which become palindromic primes when the digits are rotated once to the right.at n=17A235000
• Lesser of consecutive primes whose average is a perfect power.at n=26A242380
• Number of (n+2)X(2+2) 0..1 arrays with no 3x3 subblock diagonal sum 0 or 1 and no antidiagonal sum 0 or 1 and no row sum 0 and no column sum 0.at n=3A254972
• Number of (n+2)X(4+2) 0..1 arrays with no 3x3 subblock diagonal sum 0 or 1 and no antidiagonal sum 0 or 1 and no row sum 0 and no column sum 0.at n=1A254974
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 0 or 1 and no antidiagonal sum 0 or 1 and no row sum 0 and no column sum 0.at n=11A254978
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 0 or 1 and no antidiagonal sum 0 or 1 and no row sum 0 and no column sum 0.at n=13A254978
• Expansion of Sum_{i>=1} mu(i)^2*x^i/(1 - x^i) * Product_{j=1..i} 1/(1 - mu(j)^2*x^j), where mu() is the Moebius function (A008683).at n=45A284835
• G.f.: exp( Sum_{n>=1} A020696(n)/2 * x^n/n ), where A020696(n) = Product_{d|n} (d + 1).at n=19A299437
• Smallest full reptend prime p such that there is a gap of exactly 2n between p and the next full reptend prime, or 0 if no such prime exists.at n=43A334287
• Primes in A374965 sorted into increasing order.at n=45A373804
• Consecutive states of the linear congruential pseudo-random number generator (10924*s+11830) mod (2^15+1) when started at s=1.at n=30A384150
• a(n) = greatest prime less than prime(n)*prime(n+1).at n=37A391805
• Prime numbersat n=2980