168561

Appears in sequences

• a(n) = Sum_t t*F(n,t), where F(n,t) is the number of forests with n (unlabeled) nodes and exactly t trees, all of which are planted (that is, rooted trees in which the root has degree 1).at n=15A005199
• Base 7 digits are, in order, the first n terms of the periodic sequence with initial period 1,3,0.at n=6A037600
• n^k - n! where n^k > n! >= n^(k-1).at n=7A111683
• a(n) is the total number of down steps between the third and fourth up steps in all 2_1-Dyck paths of length 3*n. A 2_1-Dyck path is a lattice path with steps (1, 2), (1, -1) that starts and ends at y = 0 and stays above the line y = -1.at n=8A334644