31607
domain: N
Properties
Primality
- Prime
- yes
Appears in sequences
- a(n) = floor(n^log(n)).at n=24A061567
- Expansion of Product_{k>=1} (1 + A001055(k)*x^k).at n=45A066816
- Indices of prime generalized tetranacci numbers, A073817.at n=28A104577
- Chen primes p such that their p + 2 counterpart is a Sarrus number (pseudoprime to base 2).at n=6A109994
- Largest prime <= square root of 10^n.at n=8A132153
- Fourth root of largest n-digit number with exactly five divisors.at n=16A174394
- Dispersion of (floor(2*n*sqrt(2))), by antidiagonals.at n=56A191540
- Lesser of pseudo twin primes to base 2.at n=23A192297
- T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, without 2-loops or left turns.at n=37A221828
- Number of 2 X n arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, without 2-loops or left turns.at n=7A221829
- p-INVERT of (0,0,0,1,2,3,5,8,...), the Fibonacci numbers preceded by three zeros, where p(S) = 1 - S - S^2.at n=21A289977
- Rectangular array read by antidiagonals: a(m,n) = 2 * Integral_{t>=0} T_n((t+m)/2)*exp(-t)*dt, m>=0, n>=0, where T_n(x) is n-th Chebyshev polynomial of first kind.at n=52A300480
- a(n) = 2 * Integral_{t>=0} T_n(t/2+1) * exp(-t) * dt, n>=0, where T_n(x) is n-th Chebyshev polynomial of first kind.at n=7A300484
- Primes p followed by two or more 2-pseudoprimes (A001567) before the next prime.at n=2A359490
- a(n) = Sum_{k=0..n} (5*k+1) * binomial(4*n+k+1,n-k)/(4*n+k+1).at n=6A390710
- Prime numbersat n=3401