186304

Appears in sequences

• a(n+2) = 2*a(n+1) + 2*a(n); a(0) = 1, a(1) = 3.at n=12A028859
• Number of elements in the coprime subsets of the integers 1 to n.at n=29A087080
• a(n) = 2^(n-1)*ChebyshevU(n-1, 2).at n=7A099156
• a(n) = 2*a(n-1) + 4*a(n-2) - 4*a(n-3) - 4*a(n-4).at n=13A099176
• a(n)=2a(n-1)+4a(n-2)-4a(n-3)-4a(n-4).at n=13A099177
• a(n) = 2*a(n-1) + 2*a(n-2) for n > 2, a(0)=1, a(1)=1, a(2)=3.at n=13A155020
• Number of (n+1) X (2+1) 0..3 arrays with no 2 X 2 subblock having the sum of its diagonal elements less than the minimum of its antidiagonal elements.at n=1A251485
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no 2X2 subblock having the sum of its diagonal elements less than the minimum of its antidiagonal elements.at n=4A251491
• 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=11A263598
• Array read by descending antidiagonals: A(n,k) is the number of achiral colorings of the edges of a regular n-dimensional simplex using up to k colors.at n=32A327086
• Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of g.f. 1/(1 - 2*k*x + k*x^2).at n=61A342133