103248

Appears in sequences

• a(n)/(n*n!) is the average number of comparisons needed to find a node in a binary search tree containing n nodes inserted in a random order.at n=6A063090
• Expansion of (1 + 2*x)/(1 - 6*x + 6*x^2).at n=7A276265