Unordered picks of n objects from N types with repetition allowed: N_U_n = C(n + (N-1), N-1), eq (1.16). The equal form C(n+N-1, n) is computed as a cross-check. Worked cases: eq (1.17) n=10, N=4 -> 286; eq (1.48) n=2, N=6 -> 21; eq (1.49) n=2 -> N(N+1)/2; eq (1.50) N=2 -> n+1; eq (1.53) N=3 -> (n+1)(n+2)/2.
