A288796 - OEIS

%I #17 Jun 19 2017 18:46:50

%S 6,279,305868,10210452146391,5764678901089651494212581315486920,

%T 7007522073643519244177937570089174585653471798870178330313274704558499562496773948518048745883

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

%C Terms up to about a(10) can be computed using a transfer matrix method. - _Andrew Howroyd_, Jun 18 2017

%H Andrew Howroyd, <a href="/A288796/b288796.txt">Table of n, a(n) for n = 1..7</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/GraphPath.html">Graph Path</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/HanoiGraph.html">Hanoi Graph</a>

%Y Cf. A288839 (chromatic polynomials of the n-Hanoi graph).

%Y Cf. A193233 (chromatic polynomial with highest coefficients first).

%Y Cf. A137889 (directed Hamiltonian paths in the n-Hanoi graph).

%Y Cf. A288490 (independent vertex sets in the n-Hanoi graph).

%Y Cf. A286017 (matchings in the n-Hanoi graph).

%Y Cf. A193136 (spanning trees of the n-Hanoi graph).

%K nonn

%O 1,1

%A _Eric W. Weisstein_, Jun 16 2017

%E a(4)-a(6) from _Andrew Howroyd_, Jun 18 2017