25533

Appears in sequences

• Structured hexagonal diamond numbers (vertex structure 5).at n=26A100178
• Number of (n+1) X 2 0..2 arrays containing all values 0..2 with every 2 X 2 subblock having one or two distinct values, and new values 0..2 introduced in row major order.at n=5A210088
• Number of (n+1)X7 0..2 arrays containing all values 0..2 with every 2X2 subblock having one or two distinct values, and new values 0..2 introduced in row major order.at n=0A210093
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays containing all values 0..2 with every 2X2 subblock having one or two distinct values, and new values 0..2 introduced in row major order.at n=15A210095
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays containing all values 0..2 with every 2X2 subblock having one or two distinct values, and new values 0..2 introduced in row major order.at n=20A210095
• Hilltop maps: number of n X 3 binary arrays indicating the locations of corresponding elements not exceeded by any king-move neighbor in a random 0..1 n X 3 array.at n=4A218658
• Hilltop maps: number of nX5 binary arrays indicating the locations of corresponding elements not exceeded by any king-move neighbor in a random 0..1 nX5 array.at n=2A218660
• T(n,k) = Hilltop maps: number of n X k binary arrays indicating the locations of corresponding elements not exceeded by any king-move neighbor in a random 0..1 n X k array.at n=23A218663
• T(n,k) = Hilltop maps: number of n X k binary arrays indicating the locations of corresponding elements not exceeded by any king-move neighbor in a random 0..1 n X k array.at n=25A218663
• Positions of squares in A276573.at n=52A277014
• Number of sets of exactly seven positive integers <= n having a square element sum.at n=18A281867
• Number of vertices in a complete bipartite graph where the n vertices of each part are placed on the vertices, and on opposite sides, of a regular 2n-gon.at n=18A392971