66008

Appears in sequences

• a(n) = A027113(n, n+2).at n=15A027114
• Number of 1-2-3-4 trees with n edges and with thinning limbs. A 1-2-3-4 tree is an ordered tree with vertices of outdegree at most 4. A rooted tree with thinning limbs is such that if a node has k children, all its children have at most k children.at n=13A124499
• a(n) = a(n-1) + a(n-2) - [a(n-4)/4] - [a(n-5)/2] - [a(n-6)/4].at n=28A173597
• Number of partitions of n containing no part i of multiplicity i+1.at n=45A277099