20588

Appears in sequences

• Total number of possible standard knight moves on an n X 2n chessboard, if the knight is placed anywhere.at n=36A180319
• Number of permutations of 1..n with number of rises (p(i+1)>p(i)) the same as number of rises in the inverse permutation.at n=8A180389
• 6X6X6 triangular graph without horizontal edges coloring a rectangular array: number of nX2 0..20 arrays where 0..20 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 10,15 10,16 11,16 11,17 12,17 12,18 13,18 13,19 14,19 14,20 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=3A223461
• 6X6X6 triangular graph without horizontal edges coloring a rectangular array: number of nX4 0..20 arrays where 0..20 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 10,15 10,16 11,16 11,17 12,17 12,18 13,18 13,19 14,19 14,20 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=1A223463
• T(n,k)=6X6X6 triangular graph without horizontal edges coloring a rectangular array: number of nXk 0..20 arrays where 0..20 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 10,15 10,16 11,16 11,17 12,17 12,18 13,18 13,19 14,19 14,20 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=11A223467
• T(n,k)=6X6X6 triangular graph without horizontal edges coloring a rectangular array: number of nXk 0..20 arrays where 0..20 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 10,15 10,16 11,16 11,17 12,17 12,18 13,18 13,19 14,19 14,20 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=13A223467
• Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) < number of parts of p.at n=38A241828
• Number of symmetric 5 X 5 matrices of nonnegative integers with zeros on the main diagonal and every row and column adding to n.at n=7A244868
• Number of length n 1..(1+1) arrays with every leading partial sum divisible by 2, 3 or 5.at n=33A254820
• Number of 2 X 2 matrices with all terms in {-n,...,0,...,n} and (sum of terms) = permanent.at n=37A280914
• Number of tilings of a 20 X n rectangle using 2*n copies of the disconnected shape [ooooo_____ooooo].at n=37A322473
• Largest number whose base-n expansion cannot be subdivided to form a sequence of numbers which ordered form a multiple of n+1 when using +, *, and ().at n=10A330671
• a(n) is the number of numbers k such that A340873(k) = n.at n=32A341218
• Number of partitions of n into 10 or more distinct parts.at n=40A347577