67108865
domain: N
Appears in sequences
- a(n) = 2^n + 1.at n=26A000051
- Jacobsthal-Lucas numbers.at n=26A014551
- Pisot sequence L(5,9).at n=24A020737
- Numbers whose cube is palindromic in base 4.at n=14A046231
- Pisot sequence L(3,5).at n=25A048578
- Number of conjugacy classes in Clifford group CL(n).at n=26A049332
- If n is even then 2^n+1 otherwise 2^n.at n=26A052531
- a(n) = 4^n + 1.at n=13A052539
- a(2*n+1) = 1, a(2*n) = 2*a(2*n-2) - 1.at n=52A052552
- Squarefree part of 2^n+1 : the smallest number such that a(n)*(2^n+1) is a square.at n=26A069111
- Let u(1)=u(2)=u(3)=2, u(n)=(1+u(n-1)u(n-2))/u(n-3); then a(n) is the numerator of u(n).at n=27A076737
- Least m such that B(n!) = B(n!+m), where B(n) is the sum of binary digits of n.at n=30A078610
- a(n)*a(n+3) - a(n+1)*a(n+2) = 2^n, given a(0)=1, a(1)=2, a(2)=2.at n=27A080880
- Smallest composite number which is 1 more than the product of n (not necessarily distinct) prime numbers.at n=25A081547
- Using Euler's 6-term sequence A014556, we define the partial recurrence relation a(0)=2, a(1)=3, a(2)=5; a(k) = 2*a(k-1) - 1 - (-2)^(k-2), 3 <= k <= 5.at n=26A082605
- a(0) = 1; for n>0, a(n) = 2^n + 1.at n=26A083318
- a(n) = (2^(n-1) + prime(n+1)-prime(n))/2.at n=27A085431
- a(n) = 2^(n-1) + (2 + (-1)^n)^((n-2)/2).at n=26A085613
- Smallest k such that k^3 == 1 (mod some n-th power), k > 1.at n=25A088039
- Related to random walks on the 4-cube.at n=14A092896