84322

Appears in sequences

• Place n points on each of the three sides of a triangle, 3n points in all; a(n) = number of nondegenerate triangles that can be constructed using these points (plus the 3 original vertices) as vertices.at n=26A130748
• Number of (n+2)X5 binary arrays avoiding patterns 010 and 101 in rows, columns and nw-to-se diagonals.at n=3A203350
• Number of (n+2)X6 binary arrays avoiding patterns 010 and 101 in rows, columns and nw-to-se diagonals.at n=2A203351
• T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 010 and 101 in rows, columns and nw-to-se diagonals.at n=17A203355
• T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 010 and 101 in rows, columns and nw-to-se diagonals.at n=18A203355
• Sum of the largest parts in the partitions of n into 7 parts.at n=45A308933
• Number of partitions of n such that 3*(greatest part) >= (number of parts).at n=44A347867