40796

Appears in sequences

• Numbers k such that sigma(sigma(sigma(k))) == 6*sigma(k).at n=32A067065
• Triangle read by rows: T(n,k) is the number of rooted trees with k nodes which are disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children.at n=32A094262
• Number of 4-step one space at a time bishop's tours on an n X n board summed over all starting positions.at n=35A187157
• Number of ways to place 3 nonattacking grasshoppers on a chessboard of size n x n.at n=7A190395
• Number of nX5 0..1 arrays with every element unequal to 0, 2, 3, 5 or 8 king-move adjacent elements, with upper left element zero.at n=11A305357
• Expansion of e.g.f. 1 - LambertW(-log(1+x))*(2 + LambertW(-log(1+x)))/2.at n=8A323619