Let a(n) count the number of finite sequences (s(0), s(1), ..., s(n)) satisfying s(k) >= 0 (0 <= k <= n) s(0) = 0 |s(k)-s(k-1)| = k (1 <= k <= n) Is there a closed form for a(n)? -------------------------------- - David Wilson