64514

Appears in sequences

• a(n) = 16a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 16.at n=4A090727
• Number of winning paths of length n+1 across an n X n Hex board.at n=9A096367
• A triangular sequence: T(n,m) = t1(n,m) + t1(n,n-m) where t1(n,m) = -Sum_{j=0..m+1} (-1)^j * t0(n + 2, j) * (m - j + 1)^(n + 1) and t0(n,m) = Sum_{j=0..m+1} (-1)^j * binomial(n + 2, j) * (m - j + 1)^(n + 1).at n=17A154869
• A triangular sequence: T(n,m) = t1(n,m) + t1(n,n-m) where t1(n,m) = -Sum_{j=0..m+1} (-1)^j * t0(n + 2, j) * (m - j + 1)^(n + 1) and t0(n,m) = Sum_{j=0..m+1} (-1)^j * binomial(n + 2, j) * (m - j + 1)^(n + 1).at n=18A154869
• Numbers such that floor(a(n)^2 / 7) is a square.at n=14A204516
• Numbers k such that s(k) = s(k+1) but phi(k) != phi(k+1), where s(k) = phi(k) + phi(phi(k)) + ... + 1 is the sum of iterated phi (A092693).at n=23A291177
• a(n) = n^4 + 8*n^3 + 20*n^2 + 16*n + 2.at n=14A304725
• Number of nX4 0..1 arrays with every element unequal to 2, 3 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=9A317867
• For each row n in array A374602(n, k), the asymptotic geometric growth factor of every A377290(n) terms, represented by its nearest integer.at n=22A377291