151945

Appears in sequences

• Number of rooted trees with n nodes and 8 leaves.at n=8A055283
• a(0) = 0. If n is odd, a(n) = a(n-1) + n, otherwise a(n) = a(n-1) * n.at n=13A077138
• a(0) = 1; a(n+1) = a(n)*2n + 2n + 1.at n=7A085644
• Number of binary words of length n such that in every prefix and in every suffix the difference between the number of 1's and the number of 0's is in the interval [-2,3].at n=21A306306