251889

Appears in sequences

• Sort then Add, a(1)=15.at n=24A033898
• Sort then Add, a(1)=21.at n=23A033901
• Number of unordered full binary trees with labels from a set of n labels.at n=7A220452
• a(n) is the total number of paths starting at (0,0), ending at (n,0), consisting of steps (1,1), (1,0), (1,-2), and staying on or above y = -1.at n=15A378849