118768

Appears in sequences

• Total height of all binary search trees with n internal nodes.at n=10A335921
• a(n) is the n-th number which can be represented as the sum of n distinct n-almost primes in exactly n ways, or -1 if fewer than n such numbers exist.at n=10A384842
• Value of T[2] after the n-th iteration, when the map T is initialized with T[1] = 1 and in subsequent iterations, T[v] = k + (T[v] if defined else 0) for all key-value pairs (k, v) in T; a(n) = 0 if T[2] isn't defined yet.at n=21A390942