1390592

Appears in sequences

• a(n+2) = 2*a(n+1) + 2*a(n); a(0) = 1, a(1) = 3.at n=14A028859
• a(n) = 2^(n-1)*ChebyshevU(n-1, 2).at n=8A099156
• a(n) = 2*a(n-1) + 4*a(n-2) - 4*a(n-3) - 4*a(n-4).at n=15A099176
• a(n)=2a(n-1)+4a(n-2)-4a(n-3)-4a(n-4).at n=15A099177
• a(n) = 2*a(n-1) + 2*a(n-2) for n > 2, a(0)=1, a(1)=1, a(2)=3.at n=15A155020
• Number of (n+1) X (1+1) arrays of permutations of 0..n*2+1 filled by rows with each element moved a city block distance of 0 or 2, and rows and columns in increasing lexicographic order.at n=13A263598
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 305", based on the 5-celled von Neumann neighborhood.at n=20A280976