61441
domain: N
Properties
Primality
- Prime
- yes
Appears in sequences
- Primes p such that number of primes produced according to rules stipulated in Honaker's A048853 is 2.at n=13A050664
- Primes of the form 512*k+1.at n=22A076339
- Elite primes: a prime number p is called elite if only a finite number of Fermat numbers 2^(2^n)+1 are quadratic residues mod p.at n=7A102742
- A132749 * [1, 2, 3, ...] = A007318 * A065190.at n=13A132750
- a(n) = smallest positive prime number of the form x^2 - n! (where x is a positive integer).at n=9A143932
- Primes of the form 2^j - 2^k + 1, where j > k >= 0.at n=31A152449
- a(n) = 60*n^2 + 1.at n=32A158673
- Primes p such that (p+3839)/3840 is also a prime number.at n=3A162141
- Prime numbers with gaps larger than 20 towards both neighboring primes.at n=30A163112
- a(n) = 15*2^(n+1) + 1.at n=11A195744
- Primes of the form 15*2^k + 1.at n=5A195745
- Numbers n such that (23^n - 1)/22 is prime.at n=2A204940
- 2^(n-1) - floor((2^(n-1) - 1)/(n-1)).at n=15A213255
- Primes of the form 2^k*(2^{phi(m)} - 1) + 1, where k and m are positive integers, and phi(.) is Euler's totient function.at n=25A234388
- a(1) = 2; thereafter, a(n) is the smallest prime not yet used which is compatible with the condition that a(n) is a non-quadratic residue modulo a(k) for the next n indices k = n + 1, n + 2, ..., 2n.at n=24A249797
- Primes having only {1, 4, 6} as digits.at n=28A260269
- Primes p for which A329697(p) == 3.at n=42A334093
- The prime terms of A225563.at n=32A335120
- Primes p such that p == 1 (mod A001414(p-1)) and p == 1 (mod A001414(p+1)).at n=12A339181
- a(n) is the smallest prime p such that p - 1 has 2*n divisors.at n=25A340870