81864

Appears in sequences

• If n mod 2 = 0 then a(n) = n^4/4 - 2*n^2 + 3*n; otherwise, a(n) = n^4/4 - 2*n^2 + 3*n - 5/4.at n=24A064835
• a(0)=1, a(1)=8, a(n)=17*a(n-1)-64*a(n-2) for n>1.at n=5A165323
• Number of (n+1) X 3 0..3 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.at n=2A205938
• Number of (n+1) X 4 0..3 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.at n=1A205939
• T(n,k) = number of (n+1) X (k+1) 0..3 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.at n=7A205944
• T(n,k) = number of (n+1) X (k+1) 0..3 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.at n=8A205944
• a(n) = [x^n] 1/(1 - n*x/(1 - n*x^2/(1 - n*x^3/(1 - n*x^4/(1 - n*x^5/(1 - ...)))))), a continued fraction.at n=6A291274
• Number of 4-cycles in the n-cycle complement and (n+1)-wheel complement graph.at n=29A367985