31651

Appears in sequences

• Strong pseudoprimes to base 26.at n=13A020252
• Strong pseudoprimes to base 67.at n=15A020293
• Numbers k such that 163*2^k-1 is a prime.at n=5A050833
• Composite n such that both n and its reversal in base 10 are squarefree, none of the prime factors of n are palindromes and the prime factors of the reversal of n are the reversals of those of n.at n=8A083526
• Indices of primes in sequence defined by A(0) = 19, A(n) = 10*A(n-1) - 11 for n > 0.at n=11A102028
• a(n) = (14^(2*n+1) + 3^(2*n+1)) / 17.at n=2A138200
• Numbers k such that k^p-p is prime, where p is product of the digits of k.at n=24A178328
• Number of (n+1)X(4+1) 0..1 arrays with no element greater than all horizontal neighbors or less than all vertical neighbors.at n=4A237855
• Number of (n+1)X(5+1) 0..1 arrays with no element greater than all horizontal neighbors or less than all vertical neighbors.at n=3A237856
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with no element greater than all horizontal neighbors or less than all vertical neighbors.at n=31A237859
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with no element greater than all horizontal neighbors or less than all vertical neighbors.at n=32A237859
• Zeroless numbers k such that k - (sum of digits of k) and k - (product of digits of k) contain the same distinct digits as k.at n=9A248717
• Number of (6+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=28A250660
• Least integer N > 2 such that the number of primes (<=N) <= the number of base-n-zero containing numbers (<=N).at n=23A306521