23712

Appears in sequences

• Matrix log of triangle A098539, which shifts columns left and up under matrix square; these terms are the result of multiplying each element in row n and column k by (n-k)!.at n=29A111810
• Area common to integer-sided isosceles triangles (x,x,y) and (x,x,z=y+2d), sorted on x > z/2, d being positive.at n=40A120644
• Bishops on a 2n+1 X 2n+1 board (see Robinson paper for details).at n=9A123071
• Values of n*d(k)*sopf(k) associated with A134382.at n=18A134386
• Row sums of number triangle A159971.at n=11A159972
• Triangle T(n, k) = coefficients of ( t(n, x) ) where t(n, x) = (1-x)^(n+1)*p(n, x)/x, p(n, x) = x*D( p(n-1, x) ), with p(1, x) = x/(1-x)^2, p(2, x) = x*(1+x)/(1-x)^3, and p(3, x) = x*(1+8*x+x^2)/(1-x)^4, read by rows.at n=38A166340
• Triangle T(n, k) = coefficients of ( t(n, x) ) where t(n, x) = (1-x)^(n+1)*p(n, x)/x, p(n, x) = x*D( p(n-1, x) ), with p(1, x) = x/(1-x)^2, p(2, x) = x*(1+x)/(1-x)^3, and p(3, x) = x*(1+8*x+x^2)/(1-x)^4, read by rows.at n=42A166340
• Numbers of the form p^5*q*r*s where p, q, r, and s are distinct primes.at n=29A179704
• Values x for records of the minima of the positive distance d between the eleventh power of a positive integer x and the square of an integer y such that d = x^11 - y^2 (x <> k^2 and y <> k^11).at n=47A179794
• Number of arrangements of 4 nonzero numbers x(i) in -n..n with the sum of x(i)*x(i+1) equal to zero.at n=31A188250
• Number of 2 X 2 matrices having all terms in {-n,...,0,...,n} and determinant n-1.at n=31A211141
• Number of (w,x,y,z) with all terms in {0,...,n} and (least gapsize)>2.at n=15A212899
• 5 X 5 X 5 triangular graph coloring a rectangular array: number of n X 1 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 0,2 1,2 1,3 1,4 2,4 3,4 2,5 4,5 3,6 3,7 4,7 6,7 4,8 5,8 7,8 5,9 8,9 6,10 6,11 7,11 10,11 7,12 8,12 11,12 11,12 8,13 9,13 12,13 9,14 13,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=5A223337
• 5X5X5 triangular graph coloring a rectangular array: number of nX6 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 0,2 1,2 1,3 1,4 2,4 3,4 2,5 4,5 3,6 3,7 4,7 6,7 4,8 5,8 7,8 5,9 8,9 6,10 6,11 7,11 10,11 7,12 8,12 11,12 11,12 8,13 9,13 12,13 9,14 13,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=0A223342
• T(n,k)=5X5X5 triangular graph coloring a rectangular array: number of nXk 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 0,2 1,2 1,3 1,4 2,4 3,4 2,5 4,5 3,6 3,7 4,7 6,7 4,8 5,8 7,8 5,9 8,9 6,10 6,11 7,11 10,11 7,12 8,12 11,12 11,12 8,13 9,13 12,13 9,14 13,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=15A223344
• T(n,k)=5X5X5 triangular graph coloring a rectangular array: number of nXk 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 0,2 1,2 1,3 1,4 2,4 3,4 2,5 4,5 3,6 3,7 4,7 6,7 4,8 5,8 7,8 5,9 8,9 6,10 6,11 7,11 10,11 7,12 8,12 11,12 11,12 8,13 9,13 12,13 9,14 13,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=20A223344
• Number of (n+2) X (2+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000000 or 00000001.at n=8A259636
• Number of nX7 0..2 arrays with no element equal to any value at offset (-2,0) (-1,2) or (0,-2) and new values introduced in order 0..2.at n=3A275564
• T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-2,0) (-1,2) or (0,-2) and new values introduced in order 0..2.at n=48A275565
• Number of 4Xn 0..2 arrays with no element equal to any value at offset (-2,0) (-1,2) or (0,-2) and new values introduced in order 0..2.at n=6A275567