130870

Appears in sequences

• Let phi be the one-to-one mapping between binary trees and natural numbers described in the Tychonievich link. Let a(n) = min({phi^{-1}(t)| size(t)=n}); i.e., a(n) is the rank -- starting from 0 -- of the first tree the size of which is n.at n=25A296689
• The number of connected weighted cubic graphs with weight n on 8 vertices.at n=16A321307