45863
domain: N
Properties
Primality
- Prime
- yes
Appears in sequences
- Primes that remain prime through 3 iterations of function f(x) = 2x + 7.at n=29A023275
- Denominators of continued fraction convergents to sqrt(46).at n=12A041079
- a(n) is the smallest integer such that the sum of any three ordered terms a(k), k <= n, is unique.at n=27A051912
- Numbers k such that k^2 + k - 1 and k^2 + k + 1 are twin primes and (k + 1)*(k + 1) + k + 1 - 1 and (k + 1)*(k + 1) + k + 1 + 1 are also twin primes.at n=13A088498
- a(n) = A000040(A096480(n)).at n=29A096481
- Least prime p such that sigma(x)=sigma(p) has exactly n solutions.at n=34A115374
- Primes p such that (p reversed)+10 is a square.at n=10A167474
- Greatest number (in decimal representation) with n nonprime substrings in base-6 representation (substrings with leading zeros are considered to be nonprime).at n=6A217116
- Primes of the form 2*n^2 + 74*n + 35.at n=17A217500
- a(n) = Sum_{k=1..n} mu(k) * floor(n/k)^n.at n=5A332468
- Number of ordered 6-tuples (a,b,c,d,e,f) with gcd(a,b,c,d,e,f)=1 (1<= {a,b,c,d,e,f} <= n).at n=5A343978
- Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) is the number of ordered k-tuples (x_1, x_2, ..., x_k) with gcd(x_1, x_2, ..., x_k) = 1 (1 <= {x_1, x_2, ..., x_k} <= n).at n=60A344527
- Least of three consecutive primes p, q, r such that p + q, p + r, q + r and p + q + r all have the same number of prime divisors, counted with multiplicity.at n=12A368785
- a(n) is the first prime p such that, if q are r are the next two primes, p + r, p + q, q + r and p + q + r all have n prime divisors, counted with multiplicity.at n=2A368786
- Prime numbersat n=4751