6031565

Appears in sequences

• G.f. A(x) satisfies: A(x) = x + B(x)*C(x), where B(x) = x + 2*C(x)*A(x) and C(x) = x + 3*B(x)*A(x).at n=10A229811
• Number of nX3 0..2 arrays with every element plus 1 mod 3 equal to some element at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) (1,-1) or (1,0), with upper left element zero.at n=5A278001
• Number of nX6 0..2 arrays with every element plus 1 mod 3 equal to some element at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) (1,-1) or (1,0), with upper left element zero.at n=2A278004
• T(n,k)=Number of nXk 0..2 arrays with every element plus 1 mod 3 equal to some element at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) (1,-1) or (1,0), with upper left element zero.at n=30A278006
• T(n,k)=Number of nXk 0..2 arrays with every element plus 1 mod 3 equal to some element at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) (1,-1) or (1,0), with upper left element zero.at n=33A278006