68052
domain: N
Appears in sequences
- Number of n X 5 0..3 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling three no more than once.at n=1A269198
- T(n,k)=Number of nXk 0..3 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling three no more than once.at n=16A269201
- Number of 2 X n 0..3 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling three no more than once.at n=4A269202
- Number of partitions of n with rank a multiple of 3.at n=49A328988
- Triangle read by rows: Take a hexagon with all diagonals drawn, as in A331931. Then T(n,k) = number of k-sided polygons in that figure for k = 3, 4, ..., n+4.at n=42A331932