|
%I #9 Mar 30 2012 16:52:03
%S 1,1,1,1,2,1,1,3,3,1,1,5,10,4,1,1,6,36,35,5,1,1,9,310,4630,218,6,1
%N Triangle read by rows: number of genlex Gray paths on subcubes that use a certain restricted set of transformations.
%C See Knuth Vol. 4A page 737 for precise definition.
%D D. E. Knuth, The Art of Computer Programming, vol. 4A, Combinatorial Algorithms, Section 7.2.1.3 (p. 737).
%e Triangle begins:
%e 1
%e 1 1
%e 1 2 1
%e 1 3 3 1
%e 1 5 10 4 1
%e 1 6 36 35 5 1
%e 1 9 310 4630 218 6 1
%e ...
%Y Cf. A194673.
%K nonn,tabl,more
%O 0,5
%A _N. J. A. Sloane_, Sep 01 2011
|
