260192

Appears in sequences

• If n mod 2 = 0 then a(n) = n^4/4 - 2*n^2 + 3*n; otherwise, a(n) = n^4/4 - 2*n^2 + 3*n - 5/4.at n=32A064835
• Breadth-first-wise A014486-like encoding of A080299-trees.at n=15A080313