30641

Appears in sequences

• Number of forests of labeled rooted trees of height at most 1, with n labels, where any root may contain >= 1 labels, also row sums of A143395, A143396 and A143397.at n=7A143405
• 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, 0, 0)}.at n=8A151035
• 10-step Fibonacci sequence starting with 0,0,0,1,0,0,0,0,0,0.at n=25A251764