User blog comment:Vel!/Omega and power towers/@comment-25418284-20130418191049

It has been conjectured that the second difference of \(W(n)\) is the "number of rooted forests with \(n\) nodes in which each component contains at least two nodes." I would not be surprised if this turns out to be true &mdash; combinatorics is weird.