11296321

Appears in sequences

• a(1) = 1, a(n+1) is the smallest square greater than the n-th partial sum.at n=22A076967
• Number of n X 2 0..3 arrays avoiding the pattern z z+1 z in any row, column, diagonal or antidiagonal.at n=5A206791
• Number of n X 6 0..3 arrays avoiding the pattern z z+1 z in any row, column, diagonal or antidiagonal.at n=1A206795
• T(n,k)=Number of nXk 0..3 arrays avoiding the pattern z z+1 z in any row, column, diagonal or antidiagonal.at n=22A206797
• T(n,k)=Number of nXk 0..3 arrays avoiding the pattern z z+1 z in any row, column, diagonal or antidiagonal.at n=26A206797
• Number of nX6 0..3 arrays avoiding the pattern z z+1 z in any row, column or nw-to-se diagonal.at n=1A206965
• T(n,k)=Number of nXk 0..3 arrays avoiding the pattern z z+1 z in any row, column or nw-to-se diagonal.at n=22A206967
• T(n,k)=Number of nXk 0..3 arrays avoiding the pattern z z+1 z in any row, column or nw-to-se diagonal.at n=26A206967
• Number of nX6 0..3 arrays avoiding the pattern z z+1 z in any row or column.at n=1A207132
• T(n,k)=Number of nXk 0..3 arrays avoiding the pattern z z+1 z in any row or column.at n=22A207134
• T(n,k)=Number of nXk 0..3 arrays avoiding the pattern z z+1 z in any row or column.at n=26A207134
• Number of nX6 0..3 arrays avoiding the pattern z z+1 z horizontally and z z-1 z vertically.at n=1A209090
• T(n,k)=Number of nXk 0..3 arrays avoiding the pattern z z+1 z horizontally and z z-1 z vertically.at n=22A209092
• T(n,k)=Number of nXk 0..3 arrays avoiding the pattern z z+1 z horizontally and z z-1 z vertically.at n=26A209092