6442450945
domain: N
Appears in sequences
- a(0) = 1; thereafter a(n) = 3*2^(n-1) + 1.at n=32A004119
- Basis for code in A075926.at n=26A075927
- a(n) = n_{2^n}.at n=30A122624
- a(n) = 6*4^n + 1.at n=15A199116
- a(n) = 6*8^n+1.at n=10A199554
- a(n) = a(n-1) + 2*a(n-2) with n>1, a(0)=2, a(1)=7.at n=31A201630
- Half the number of (n+1) X 5 0..2 arrays with every 2 X 2 subblock having exactly two distinct clockwise edge differences.at n=11A209531
- a(0) = 1, a(n+1) = 2*a(n) + periodic sequence of length 2: repeat [5, -4].at n=31A280173
- a(0) = 3, a(n+1) = 2*a(n) + periodic sequence of length 2: repeat [1, -2].at n=31A280345
- Minimum m such that the convergence speed of m^^m is equal to n >= 2, where A317905(n) represents the convergence speed of m^^m (and m = A067251(n), the n-th non-multiple of 10).at n=29A337392
- a(n) is the smallest integer k greater than 1 and not a perfect power satisfying A373387(k^n) = n.at n=30A381949