2147483649

Appears in sequences

• a(n) = 2^n + 1.at n=31A000051
• Pisot sequence L(5,9).at n=29A020737
• Pisot sequence L(3,5).at n=30A048578
• Expansion of (2-3*x-x^2+x^3)/((1-x)*(1+x)*(1-2*x)).at n=32A052950
• a(n) = 2^n + (-1)^(n+1).at n=31A062510
• a(n) = 2^n - mu(n).at n=30A062777
• Squarefree part of 2^n+1 : the smallest number such that a(n)*(2^n+1) is a square.at n=31A069111
• Least m such that B(n!) = B(n!+m), where B(n) is the sum of binary digits of n.at n=31A078610
• Least m such that B(n!) = B(n!+m), where B(n) is the sum of binary digits of n.at n=32A078610
• Smallest composite number which is 1 more than the product of n (not necessarily distinct) prime numbers.at n=30A081547
• a(0) = 1; for n>0, a(n) = 2^n + 1.at n=31A083318
• Partial sums of A084509. Positions of ones in the first differences of A084506.at n=17A084508
• a(n) = (2^(n-1) + prime(n+1)-prime(n))/2.at n=32A085431
• a(n) = 2^(2*n+1) + 1.at n=15A087289
• Smallest k such that k^3 == 1 (mod some n-th power), k > 1.at n=30A088039
• Semiprimes of the form 2^k + 1.at n=12A092562
• Expansion of (1-x-x^2)/((1-x)*(1-2*x)).at n=32A094373
• a(n) = 2^p + 1 where p is the n-th prime.at n=10A098640
• Semiprime nearest to 2^n. (In case of a tie, choose the smaller).at n=31A117405
• Smallest m such that A008687(m) = n.at n=32A127904