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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

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
325, 28506, 12139576, 5844687696, 2760949256856, 1307471887123416, 618956724210141816, 293027167159964445816, 138724393741836055216056, 65674706723578994696592696, 31091623528369957228864323576 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..11.

F. Faase, Counting Hamiltonian cycles in product graphs.

F. Faase, Results from the counting program

FORMULA

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).

CROSSREFS

Sequence in context: A031714 A133447 A179535 * A298106 A266365 A340462

Adjacent sequences:  A145411 A145412 A145413 * A145415 A145416 A145417

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Feb 03 2009

EXTENSIONS

Definition corrected by Frans J. Faase, Feb 05 2009

More terms from Max Alekseyev, Feb 12 2012

STATUS

approved

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 November 30 19:02 EST 2021. Contains 349424 sequences. (Running on oeis4.)