485982

Appears in sequences

• a(n) = (1/2)*(F(n+2)-1)*(F(n+2)-2) + F(n), where F() are the Fibonacci numbers.at n=13A131569
• Triangle T(n,k)=number of forests of labeled rooted trees of height at most 1, with n labels and k nodes, where any root may contain >= 1 labels, n >= 0, 0<=k<=n.at n=51A143397
• Minimal covering numbers.at n=72A160559
• Number of refinement sequences n -> ... -> {1}^n, where in each step one part that is the rightmost copy of its size is replaced by a partition of itself into smaller parts (in weakly decreasing order).at n=11A327702