Generation of Permutations by Addition
John R. Howell · Mathematics of Computation · 1962
Martin Marietta Corporation even, (2) ôny0 = hn ZÜLi (1 + Aïmb2m)fo + • • -, for n odd, (3) ßSny0 = hn £Í2-i (1 + A2mb2m)fo + • • -, are tabulated exactly for n = 1(1)6, m = 1(1)10.They were calculated from the well-known symbolic formulas (4) Sny = (8/D)nf, (5) (S/D)n = (ôh/2 ành_1(«/2))" and (6) M = (1 + 52/4)1/2 = 1 + £■ + 8 128 1024