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.

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

Original entry on oeis.org

3, 18, 192, 2730, 42408, 673698, 10760592, 172097370, 2753276088, 44051309778, 704816584992, 11277048051210, 180432700116168, 2886922928640258, 46190765770153392, 739052247984440250, 11824835950442034648, 189197375137965657138, 3027158001931410345792
Offset: 1

Views

Author

Eric W. Weisstein, May 14 2019

Keywords

Crossrefs

Cf. A137889.

Programs

  • PARI
    Vec(3*x*(1 - 18*x + 67*x^2 - 60*x^3) / ((1 - x)*(1 - 3*x)*(1 - 4*x)*(1 - 16*x)) + O(x^20)) \\ Colin Barker, Jul 19 2019

Formula

a(n) = A137889(n)/2.
From Colin Barker, Jul 19 2019: (Start)
G.f.: 3*x*(1 - 18*x + 67*x^2 - 60*x^3) / ((1 - x)*(1 - 3*x)*(1 - 4*x)*(1 - 16*x)).
a(n) = 24*a(n-1) - 147*a(n-2) + 316*a(n-3) - 192*a(n-4) for n>4.
a(n) = (208 + 16*3^(2+n) + 13*4^(2+n) + 25*16^n) / 624.
(End)