65537

Properties

Appears in sequences

• a(n) = 2^n + 1.at n=16A000051
• Fermat numbers: a(n) = 2^(2^n) + 1.at n=4A000215
• A sequence of sorted odd primes 3 = p_1 < p_2 < ... < p_m such that p_i-2 divides the product p_1*p_2*...*p_(i-1) of the earlier primes and each prime factor of p_i-1 is a prime factor of twice the product.at n=18A001259
• Table T(n,k) in which n-th row lists prime factors of 2^n + 1 (n >= 0), with repetition.at n=33A001269
• Sierpiński's triangle (Pascal's triangle mod 2) converted to decimal.at n=16A001317
• a(n) = n^4 + 1.at n=16A002523
• Smallest prime factor of 2^n + 1.at n=15A002586
• Smallest prime factor of 2^n + 1.at n=79A002586
• Largest prime factor of 2^n + 1.at n=16A002587
• Largest prime factor of 16^n + 1.at n=4A002590
• Quartan primes: primes of the form x^4 + y^4, x > 0, y > 0.at n=25A002645
• An infinite coprime sequence defined by recursion.at n=7A002716
• Numbers that are the sum of 2 nonzero 8th powers.at n=6A003380
• Primes of form (p^x - 1)/(p^y - 1), p prime.at n=24A003424
• a(n) = (2^2^...^2) (with n 2's) + 1.at n=4A004249
• Divisors of 2^32 - 1 (for a(1) to a(31), the 31 regular polygons with an odd number of sides constructible with ruler and compass).at n=16A004729
• Numbers that are the sum of at most 2 nonzero 8th powers.at n=11A004875
• Numbers that are the sum of at most 3 nonzero 8th powers.at n=21A004876
• Numbers that are the sum of at most 4 nonzero 8th powers.at n=36A004877
• Class 1- (or Pierpont) primes: primes of the form 2^t*3^u + 1.at n=31A005109