134217729

Appears in sequences

• a(n) = 2^n + 1.at n=27A000051
• Numbers that are the sum of 2 positive 9th powers.at n=28A003391
• If n mod 4 = 0 then 2^(n-1)+1 elif n mod 4 = 2 then 2^(n-1)-1 else 2^(n-1).at n=27A007679
• Smallest k>2^n such that 2^k == 2^n (mod k).at n=26A015938
• Pisot sequence L(5,9).at n=25A020737
• Numbers whose cube is palindromic in base 8.at n=15A046239
• Pisot sequence L(3,5).at n=26A048578
• Expansion of (2-2*x-x^3)/((1-2*x)*(1-x^3)).at n=27A052935
• Expansion of (2-3*x-x^2+x^3)/((1-x)*(1+x)*(1-2*x)).at n=28A052950
• a(n) = 8^n + 1.at n=9A062395
• a(n) = 2^n + (-1)^(n+1).at n=27A062510
• a(n) = n*8^n + 1.at n=8A064746
• Numbers of the form (8^{mr}-1)/(8^r-1) for positive integers m, r.at n=21A076287
• Smallest composite number which is 1 more than the product of n (not necessarily distinct) prime numbers.at n=26A081547
• a(n) is the closest number to 2^n which is divisible by n.at n=26A082894
• a(0) = 1; for n>0, a(n) = 2^n + 1.at n=27A083318
• Partial sums of A084509. Positions of ones in the first differences of A084506.at n=15A084508
• a(n) = 2^(2*n+1) + 1.at n=13A087289
• Smallest k such that k^3 == 1 (mod some n-th power), k > 1.at n=26A088039
• Expansion of (1-x-x^2)/((1-x)*(1-2*x)).at n=28A094373