60469

Appears in sequences

• Number of inequivalent binary [ n,3 ] codes of dimension <= 3 without zero columns.at n=39A034337
• Number of partitions satisfying cn(2,5) <= cn(0,5) + cn(1,5) + cn(4,5) and cn(3,5) <= cn(0,5) + cn(1,5) + cn(4,5).at n=43A039871
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (1, -1, 1), (1, 1, 0), (1, 1, 1)}.at n=8A150914
• Number of (n+2)X6 binary arrays avoiding patterns 000 and 011 in rows, columns and nw-to-se diagonals.at n=5A202773
• Number of (n+2)X8 binary arrays avoiding patterns 000 and 011 in rows, columns and nw-to-se diagonals.at n=3A202775
• T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 000 and 011 in rows, columns and nw-to-se diagonals.at n=39A202777
• G.f.: exp( Sum_{n>=1} A322187(n)*x^n/n ), where A322187(n) is the coefficient of x^n*y^n/n in log( Product_{n>=1} 1/(1 - x^(2*n-1) - y^(2*n-1)) ).at n=11A322188
• Number of excursions of length n with Motzkin-steps avoiding the consecutive steps UU and HH.at n=18A329666