27488

Appears in sequences

• Triangle T(n,k) is the number of restricted growth strings (RGS) of set partitions of {1..n} that have a decrease at index k (1<=k<n).at n=38A056862
• Triangle read by rows, related to A055129 (repunits in base k).at n=47A107893
• Convolution triangle by rows, A004736 * (A154108 * 0^(n-k)); row sums = Bell numbers.at n=53A154109
• Number of n X 1 0..2 arrays with no element equal to more than one of its horizontal and vertical neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=11A280279
• Number of n X 2 0..2 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=5A281320
• T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=26A281326
• Number of largest subsets of the set of points in an n X n square grid, such that no two points are at the same distance.at n=11A335232
• Irregular triangle read by rows. Properly color the vertices of a simple labeled graph on [n] using exactly n colors c_1<c_2<...<c_n (in other words, use each color exactly once). Orient the edges according to the strict order on the colors. T(n,k) is the number of such graphs with exactly k descents, n>=0, 0<=k<=binomial(n,2).at n=18A381192