login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A145414 Number of paths in K_6 X P_n joining two different vertices in K_6 from opposite sides. 0

%I

%S 325,28506,12139576,5844687696,2760949256856,1307471887123416,

%T 618956724210141816,293027167159964445816,138724393741836055216056,

%U 65674706723578994696592696,31091623528369957228864323576

%N Number of paths in K_6 X P_n joining two different vertices in K_6 from opposite sides.

%H F. Faase, <a href="http://www.iwriteiam.nl/counting.html">Counting Hamiltonian cycles in product graphs</a>.

%H F. Faase, <a href="http://www.iwriteiam.nl/Cresults.html">Results from the counting program</a>

%F For n>=10, a(n) = 426*a(n-1) + 23541*a(n-2) - 517674*a(n-3) + 77868*a(n-4) + 101434248*a(n-5) - 276637248*a(n-6) + 207532800*a(n-7) - 24883200*a(n-8).

%K nonn

%O 1,1

%A _N. J. A. Sloane_, Feb 03 2009

%E Definition corrected by _Frans J. Faase_, Feb 05 2009

%E More terms from _Max Alekseyev_, Feb 12 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 19 09:33 EST 2020. Contains 332041 sequences. (Running on oeis4.)