cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A288796 Number of (undirected) paths in the n-Hanoi graph.

Original entry on oeis.org

6, 279, 305868, 10210452146391, 5764678901089651494212581315486920, 7007522073643519244177937570089174585653471798870178330313274704558499562496773948518048745883
Offset: 1

Views

Author

Eric W. Weisstein, Jun 16 2017

Keywords

Comments

Terms up to about a(10) can be computed using a transfer matrix method. - Andrew Howroyd, Jun 18 2017

Crossrefs

Cf. A288839 (chromatic polynomials of the n-Hanoi graph).
Cf. A193233 (chromatic polynomial with highest coefficients first).
Cf. A137889 (directed Hamiltonian paths in the n-Hanoi graph).
Cf. A288490 (independent vertex sets in the n-Hanoi graph).
Cf. A286017 (matchings in the n-Hanoi graph).
Cf. A193136 (spanning trees of the n-Hanoi graph).

Extensions

a(4)-a(6) from Andrew Howroyd, Jun 18 2017