24251
domain: N
Properties
Primality
- Prime
- yes
Appears in sequences
- Smallest prime p==3 (mod 8) such that Q(sqrt(-p)) has class number 2n+1.at n=38A002148
- Number of indefinitely growing n-step self-avoiding walks on Manhattan lattice.at n=17A006745
- 3 consecutive primes differ by 2n or more starting at a(n).at n=12A054697
- 3 consecutive primes differ by 2n or more starting at a(n).at n=13A054697
- 3 consecutive primes differ by 2n or more starting at a(n).at n=14A054697
- Primes p such that x^5 = 2 has a solution mod p, but x^(5^2) = 2 has no solution mod p.at n=17A070182
- Primes in which the unit place digit is 1 and the k-th most significant digit is prime (2,3,5,7) if k is prime else is composite (4,6,8,9,0).at n=31A089704
- Number of sets of points determined by the intersection of a line with an n X n grid of points.at n=18A119438
- Primes p such that q-p = 30, where q is the next prime after p.at n=28A124596
- Primes congruent to 34 mod 61.at n=39A142832
- Let N(p,i) denote the result of applying "nextprime" i times to p; a(n) = smallest prime p such that N(p,2) - p = 2*n, or -1 if no such prime exists.at n=32A144103
- Primes p such that continued fraction of (1 + sqrt(p))/2 has period 10 : primes in A146335.at n=17A146355
- a(n) = 121*n^2 - 204*n + 86.at n=14A157440
- Primes of the form 250n + 1.at n=28A179231
- Triangle read by rows: T(n,k) = Sum_{i=n-k..n} C(k-1,n-i)*C(i,n-k)*C(2*i,i)/(i+1).at n=32A256640
- Primes of the form abs(n^5 - 99n^4 + 3588n^3 - 56822n^2 + 348272n - 286397) in order of increasing nonnegative n.at n=29A272444
- Primes of the form p=3*q+3*r+q*r where q and r are distinct primes and 2*p-3*q, 2*p-3*r and 2*p-q*r are also prime.at n=44A328822
- Number of nontrivial equivalence classes of S_n under the {1234,3412} pattern-replacement equivalence.at n=47A330395
- Lexicographically earliest sequence of distinct positive integers such that a(n), a(n+1) and the product a(n)*a(n+1) have in common the substring n.at n=24A333933
- Let N(p,i) denote the result of applying "nextprime" i times to p; a(n) = smallest prime p such that N(p,4) - p = 2*n, or -1 if no such prime exists.at n=42A339944