21288

Appears in sequences

• Expansion of g.f. (x^2+x+1)*(2*x^2+2*x+1)*(x-1)^2/((1-x^2-2*x^3)*(x^4+1)).at n=27A107850
• First differences of A000043.at n=25A134458
• Number of (n+1)X(1+1) 0..6 arrays with every 2X2 subblock having the sum of the absolute values of the edge differences equal to 12 and no adjacent elements equal.at n=2A234406
• Number of (n+1)X(3+1) 0..6 arrays with every 2X2 subblock having the sum of the absolute values of the edge differences equal to 12 and no adjacent elements equal.at n=0A234408
• T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock having the sum of the absolute values of the edge differences equal to 12 and no adjacent elements equal.at n=3A234412
• T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock having the sum of the absolute values of the edge differences equal to 12 and no adjacent elements equal.at n=5A234412
• Number of (n+1) X (n+1) 0..2 arrays colored with the upper median value of each 2 X 2 subblock.at n=6A235946
• Number of (n+1) X (7+1) 0..2 arrays colored with the upper median value of each 2 X 2 subblock.at n=6A235953
• Number of partitions p of n such that (number of numbers in p of form 3k+2) = (number of numbers in p of form 3k).at n=44A241741
• Terms of A143407, sorted.at n=43A270564
• G.f. A(x) satisfies: x = Product_{n>=1} (1 - x^n*A(x)) * (1 - x^(n-1)/A(x)).at n=9A356499
• G.f. A(x) satisfies x = Sum_{n>=1} A( x^n*(1-x)^(2*n) ).at n=7A380551