login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A194672 Triangle read by rows: number of genlex Gray paths on subcubes that use a certain restricted set of transformations. 1
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 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

0,5

COMMENTS

See Knuth Vol. 4A page 737 for precise definition.

REFERENCES

D. E. Knuth, The Art of Computer Programming, vol. 4A, Combinatorial Algorithms, Section 7.2.1.3 (p. 737).

LINKS

Table of n, a(n) for n=0..27.

EXAMPLE

Triangle begins:

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

...

CROSSREFS

Cf. A194673.

Sequence in context: A214987 A203946 A128545 * A034364 A183610 A261365

Adjacent sequences:  A194669 A194670 A194671 * A194673 A194674 A194675

KEYWORD

nonn,tabl,more

AUTHOR

N. J. A. Sloane, Sep 01 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 14 02:29 EDT 2019. Contains 327995 sequences. (Running on oeis4.)