65543

Properties

Appears in sequences

• a(1) = 11; a(n) = if n == 2 mod 3 then a(n-1)-3, if n == 0 mod 3 then a(n-1)-2, if n == 1 mod 3 then a(n-1)*2.at n=49A085688
• Primes whose representation in base 256 can be interpreted as a decimal prime.at n=16A090719
• Primes of the form 2^k + 7.at n=5A104066
• Smallest prime p > 3 such that p-1 has a prime factor > (p-1)^(n/(n+1)).at n=14A111671
• Smallest odd prime base q such that p^3 divides q^(p-1) - 1, where p = prime(n).at n=32A125637
• Fermat numbers of order 7 or F(n,7) = 2^(2^n)+7.at n=4A130730
• Sums of three Fermat numbers.at n=20A155877
• Prime sums of three Fermat numbers: primes of form 2^2^x + 2^2^y + 5.at n=6A166484
• a(n) = 2^n + 7.at n=16A168415
• a(n) = 4^(n+1) + 7.at n=7A195463
• Numbers that can be formed using its own digits in order and only addition and fourth power operators.at n=37A195672
• Primes of the form 2n^3+7.at n=11A201110
• Minimal number (in decimal representation) with n nonprime substrings in base-4 representation (substrings with leading zeros are considered to be nonprime).at n=42A217104
• n-th prime p such that (p+n)^2+n is prime but (p+j)^2+j is not prime for all 0<j<n.at n=20A238663
• Primes of the form m = 2^i + 2^j - 1, where i > j >= 0.at n=39A239712
• Primes of the form 2^x + y (x >= 0 and 0 <= y < 2^x) such that all the numbers 2^(x+a) + (y-a) (0 < a <= y) are composite.at n=39A264866
• Numbers n > 1 such that 2^(n-1) and (2*n-m)*2^(((n-1)/2) - floor(log_2(n))) are congruent to 1 (mod n) for at least one of m = 3, m = 7 and m = 15.at n=13A295196
• Permutation of natural numbers: a(n) = A156552(1+A005940(1+n)).at n=56A297163
• Primes that are the sum of a set of numbers taken from 1 and 2^(2^k) for k >= 0.at n=12A356405
• Primes p such that the polynomial x^7 - 7*x + 3 (mod p) is the product of seven linear factors.at n=36A358147