|
|
A288796
|
|
Number of (undirected) paths in the n-Hanoi graph.
|
|
10
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Terms up to about a(10) can be computed using a transfer matrix method. - Andrew Howroyd, Jun 18 2017
|
|
LINKS
|
|
|
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).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|