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.
%I A288796 #18 Feb 16 2025 08:33:48 %S A288796 6,279,305868,10210452146391,5764678901089651494212581315486920, %T A288796 7007522073643519244177937570089174585653471798870178330313274704558499562496773948518048745883 %N A288796 Number of (undirected) paths in the n-Hanoi graph. %C A288796 Terms up to about a(10) can be computed using a transfer matrix method. - _Andrew Howroyd_, Jun 18 2017 %H A288796 Andrew Howroyd, <a href="/A288796/b288796.txt">Table of n, a(n) for n = 1..7</a> %H A288796 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GraphPath.html">Graph Path</a> %H A288796 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/HanoiGraph.html">Hanoi Graph</a> %Y A288796 Cf. A288839 (chromatic polynomials of the n-Hanoi graph). %Y A288796 Cf. A193233 (chromatic polynomial with highest coefficients first). %Y A288796 Cf. A137889 (directed Hamiltonian paths in the n-Hanoi graph). %Y A288796 Cf. A288490 (independent vertex sets in the n-Hanoi graph). %Y A288796 Cf. A286017 (matchings in the n-Hanoi graph). %Y A288796 Cf. A193136 (spanning trees of the n-Hanoi graph). %K A288796 nonn %O A288796 1,1 %A A288796 _Eric W. Weisstein_, Jun 16 2017 %E A288796 a(4)-a(6) from _Andrew Howroyd_, Jun 18 2017