20340

Appears in sequences

• Coordination sequence for 4-dimensional primitive di-isohexagonal orthogonal lattice.at n=15A008530
• Number of ways to place non-intersecting diagonals in convex (n+2)-gon so as to create no quadrilaterals.at n=9A054515
• Occurrences of most frequently occurring number in 1-to-n 5-dimensional multiplication table.at n=27A057344
• Occurrences of most frequently occurring number in 1-to-n 5-dimensional multiplication table.at n=28A057344
• Sum of squares of first n quarter-squares (A002620).at n=17A059859
• Triangle, read by rows, equal to P^5, where triangle P = A135880.at n=15A135892
• Triangle R, read by rows, where column k of R equals column 0 of P^(2k+1) where P=A135880.at n=30A135894
• Triangle, read by rows equal to the matrix product R^-1*Q, where Q = A135885 and R = A135894; R^-1*Q equals triangle R shifted down one row.at n=38A135900
• Number of 11 X 11 arrays of squares of integers, symmetric under 90-degree rotation, with all rows summing to n.at n=3A156408
• Number of n X n arrays of squares of integers, symmetric under 90 degree rotation, with all rows summing to 3.at n=8A156433
• Number of nX4 0..3 arrays with no more than floor(nX4/2) elements unequal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..3 order.at n=4A222375
• Number of nX5 0..3 arrays with no more than floor(nX5/2) elements unequal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..3 order.at n=3A222376
• T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..3 order.at n=31A222378
• T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..3 order.at n=32A222378
• Number of length-4 0..n arrays with no repeated value unequal to the previous repeated value plus one mod n+1.at n=10A268945
• Sorted positions of first appearances in A368109 (number of ways to choose a binary index of each binary index).at n=40A368112