105859
domain: N
Appears in sequences
- Number of binary rooted trees with n nodes and height exactly 6.at n=30A036595
- (Terms in A028273)/2.at n=40A051298
- a(n) = 13*(2^n - 1) - 3*n^2 - 9*n.at n=12A257448
- a(n) is the number of distinct ways to cut an equilateral triangle with edges of size n into equilateral triangles with integer sides.at n=6A358715