13631489

Properties

Appears in sequences

• Prime factors of Fermat numbers.at n=12A023394
• Smallest prime factor of the n-th Fermat number F(n) = 2^(2^n) + 1.at n=18A093179
• 1 + (n+6)*2^(n-1).at n=20A115618
• a(n) = 2*a(n-1) - 1 with a(0)=14.at n=20A168596
• Primes of the form 2^r * 13^s + 1.at n=12A173236
• Odd prime factors of generalized Fermat numbers of the form 3^(2^m) + 1 with m >= 0.at n=12A273945
• Prime factors of generalized Fermat numbers of the form 6^(2^m) + 1 with m >= 0.at n=16A273947
• Prime factors of generalized Fermat numbers of the form 12^(2^m) + 1 with m >= 0.at n=21A273950
• Sorted list of prime factors of numbers of the form 3^(2^m) + 2^(2^m) with m >= 0.at n=16A294132
• Sorted list of prime factors of numbers of the form 9^(2^m) + 2^(2^m) with m >= 0.at n=16A294135
• Primes of the form 13*2^n + 1.at n=3A300406
• Divisors of Fermat numbers.at n=13A307843
• Primes p such that the odd part of p - 1 is upper-bounded by the dyadic valuation of p - 1.at n=19A361180
• a(n) = 2^n*t + 1 where t is the least x such that there exists an r in the range 2 <= r <= x+1 that is coprime to 2^n*x + 1 and has multiplicative order 2^n modulo 2^n*x + 1.at n=17A370879
• Numbers k that divide 2^(2^k) - 2^k + 1.at n=20A373580
• Prime numbersat n=887643