166400

Appears in sequences

• a(n) = 2^(n-3)*n^2*(n+3).at n=10A058645
• a(n) = binomial(n+2,3)*4^3.at n=23A141478
• Number of n X 4 0..5 arrays with no element x(i,j) adjacent to itself or value 5-x(i,j) horizontally or antidiagonally, top left element zero, and 1 appearing before 2 3 and 4, and 2 appearing before 3 in row major order (unlabelled 6-colorings with no clashing color pairs).at n=2A233252
• Number of n X 6 0..5 arrays with no element x(i,j) adjacent to itself or value 5-x(i,j) horizontally or antidiagonally, top left element zero, and 1 appearing before 2 3 and 4, and 2 appearing before 3 in row major order (unlabelled 6-colorings with no clashing color pairs).at n=1A233254
• T(n,k)=Number of nXk 0..5 arrays with no element x(i,j) adjacent to itself or value 5-x(i,j) horizontally or antidiagonally, top left element zero, and 1 appearing before 2 3 and 4, and 2 appearing before 3 in row major order (unlabelled 6-colorings with no clashing color pairs).at n=17A233256
• T(n,k)=Number of nXk 0..5 arrays with no element x(i,j) adjacent to itself or value 5-x(i,j) horizontally or antidiagonally, top left element zero, and 1 appearing before 2 3 and 4, and 2 appearing before 3 in row major order (unlabelled 6-colorings with no clashing color pairs).at n=22A233256
• Number of 2 X n 0..5 arrays with no element x(i,j) adjacent to itself or value 5-x(i,j) horizontally or antidiagonally, top left element zero, and 1 appearing before 2 3 and 4, and 2 appearing before 3 in row major order (unlabelled 6-colorings with no clashing color pairs).at n=5A233257
• Number of 3 X n 0..5 arrays with no element x(i,j) adjacent to itself or value 5-x(i,j) horizontally or antidiagonally, top left element zero, and 1 appearing before 2 3 and 4, and 2 appearing before 3 in row major order (unlabelled 6-colorings with no clashing color pairs).at n=3A233258
• Number of elements of order n in the Tits group TF4(2)'.at n=2A284952
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 150", based on the 5-celled von Neumann neighborhood.at n=18A286089
• Number of nonisomorphic proper colorings of partition star graph using five colors.at n=54A297569
• Irregular table read by rows: Take a decagon with all diagonals drawn, as in A333139. Then T(n,k) = number of k-sided polygons in that figure for k >= 3.at n=29A332417
• Numbers k such that A000005(k) = A000688(k).at n=27A369168