31445

Appears in sequences

• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 1), (0, 0, -1), (0, 1, 0), (1, -1, 0)}.at n=11A148186
• Number of partitions p of n such that max(p) - min(p) is a part of p.at n=48A238493
• Numbers k at which the ratio A288814(k) / k reaches a record high.at n=48A301592
• 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=17A381192