112609

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, 0, 1), (-1, 1, 0), (0, -1, 1), (0, 1, -1), (1, 1, 1)}.at n=9A149769
• Triangle read by rows: T(n,k) = Stirling2(n, k+1) + abs(Stirling1(n,k)), 0 <= k <= n.at n=47A152924
• a(n) = A175369(n^2).at n=35A175370
• Triangle read by rows: T(n,k) = number of rooted labeled trees with n nodes and height <= k, for n >= 1, 0 <= k <= n-1.at n=26A236396
• Triangle read by columns: T(n,k) is the number of functions from an n-element set to a k-element set that are not one-to-one, k>=n>=1.at n=26A347034