268435457
domain: N
Appears in sequences
- a(n) = 2^n + 1.at n=28A000051
- Jacobsthal-Lucas numbers.at n=28A014551
- Pisot sequence L(5,9).at n=26A020737
- Numbers k such that k^3 is palindromic in base 16.at n=20A029735
- Sum of seventh powers of unitary divisors.at n=15A034681
- a(n) = Sum_{ k, k|n } 2^(k-1).at n=28A034729
- Numbers whose cube is palindromic in base 4.at n=15A046231
- Pisot sequence L(3,5).at n=27A048578
- Number of conjugacy classes in Clifford group CL(n).at n=28A049332
- a(n) = (1/2)*A050871 (row sums of array T in A050870, periodic binary words).at n=29A050872
- If n is even then 2^n+1 otherwise 2^n.at n=28A052531
- a(n) = 4^n + 1.at n=14A052539
- Sum of n-th powers of digits of n.at n=14A055207
- Sums of two powers of 16.at n=28A055261
- Squarefree part of 2^n+1 : the smallest number such that a(n)*(2^n+1) is a square.at n=28A069111
- a(n) = Sum_{d|n} (2^(n-d)).at n=28A074854
- 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=29A076737
- 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=29A080880
- a(n) = (-1)^(n+1) * coefficient of x^n in Sum_{k>=1} x^k/(1+2*x^k).at n=28A081295
- Smallest composite number which is 1 more than the product of n (not necessarily distinct) prime numbers.at n=27A081547