84910

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, 1), (-1, 0, 1), (0, 1, -1), (0, 1, 1), (1, -1, 0)}.at n=10A148874
• Number of n X n nonnegative integer arrays with upper left 0 and lower right n+n-6 and value increasing by 0 or 1 with every step right or down.at n=4A252923
• Number of nX5 nonnegative integer arrays with upper left 0 and lower right n+5-6 and value increasing by 0 or 1 with every step right or down.at n=4A252927
• T(n,k) = Number of n X k nonnegative integer arrays with upper left 0 and lower right n+k-6 and value increasing by 0 or 1 with every step right or down.at n=40A252930
• Number of n X n integer matrices (m_{i,j}) such that m_{1,1}=1, m_{n,n}=n, and all rows and columns are (weakly) monotonic without jumps larger than 1.at n=4A306372
• Irregular triangle read by rows: T(n,d) (n >= 1, 0 <= d <= 2n-2) = number of n X n integer-valued matrices M such that M_{1,1}=0, M_{n,n}=d, and M_{(i+1),j} = M_{i,j} + (0 or 1), M_{i,(j+1)} = M_{i,j} + (0 or 1).at n=20A323849
• Numbers k such that N = k^6 is a twin rank (cf. A002822: 6N +- 1 are twin primes).at n=22A326236