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.

A124352 Number of directed Hamiltonian paths on the n-antiprism graph.

This page as a plain text file.
%I A124352 #64 Feb 16 2025 08:33:03
%S A124352 240,816,2400,6480,16660,41440,100836,241520,571692,1340832,3121456,
%T A124352 7222040,16622220,38085312,86918688,197677368,448182640,1013320480,
%U A124352 2285339532,5142429512,11547488652,25881229248,57906534100,129352490384,288522099360,642668803056,1429687270740,3176714397960
%N A124352 Number of directed Hamiltonian paths on the n-antiprism graph.
%H A124352 Andrew Howroyd, <a href="/A124352/b124352.txt">Table of n, a(n) for n = 3..50</a>
%H A124352 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/AntiprismGraph.html">Antiprism Graph</a>
%H A124352 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/HamiltonianPath.html">Hamiltonian Path</a>
%F A124352 Conjectures from _Colin Barker_, Dec 21 2015: (Start)
%F A124352 a(n) = 5*a(n-1)-6*a(n-2)-4*a(n-3)+7*a(n-4)+5*a(n-5)-5*a(n-6)-3*a(n-7)+a(n-8)+a(n-9) for n>11.
%F A124352 G.f.: 4*x^3*(60-96*x-60*x^2+84*x^3+61*x^4-73*x^5-41*x^6+15*x^7+14*x^8) / ((1-x)^3*(1-x-2*x^2-x^3)^2).
%F A124352 (End)
%F A124352 Equivalent conjecture: a(n) = 2*a(n-1) +3*a(n-2) -2*a(n-3) -6*a(n-4) -4*a(n-5) -a(n-6) +672*n -1376 -72*n^2 if n>=9. - _R. J. Mathar_, Jan 25 2016
%Y A124352 Cf. A124353 (numbers of directed Hamiltonian cycles).
%K A124352 nonn
%O A124352 3,1
%A A124352 _Eric W. Weisstein_, Oct 27 2006
%E A124352 a(6)-a(10) from _Eric W. Weisstein_, Apr 03 2008
%E A124352 a(11)-a(18) from _Eric W. Weisstein_, Dec 16 2013
%E A124352 a(19)-a(30) from _Andrew Howroyd_, Dec 20 2015