Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003742
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003742 Number of 2-factors in O_5 X P_n. +0
1
6, 327, 11040, 406731, 14683587, 532938234, 19313709882, 700238873703, 25384576377228, 920260033555854, 33361543878231264, 1209436952734137963, 43844979765366718719, 1589485790652572990865 (list; graph; listen)
OFFSET

1,1

REFERENCES

F. Faase, On the number of specific spanning subgraphs of the graphs G X P_n, Ars Combin. 49 (1998), 129-154.

LINKS

F. Faase, On the number of specific spanning subgraphs of the graphs G X P_n, Preliminary version of paper that appeared in Ars Combin. 49 (1998), 129-154.

F. Faase, Counting Hamilton cycles in product graphs

F. Faase, Results from the counting program

F. Faase, Counting Hamilton cycles in product graphs

FORMULA

a(1) = 6,

a(2) = 327,

a(3) = 11040,

a(4) = 406731,

a(5) = 14683587,

a(6) = 532938234, and

a(n) = 26a(n-1) + 396a(n-2) - 707a(n-3) - 6539a(n-4) + 7239a(n-5) - 405a(n-6).

CROSSREFS

Sequence in context: A074656 A135397 A042421 this_sequence A135195 A001509 A003031

Adjacent sequences: A003739 A003740 A003741 this_sequence A003743 A003744 A003745

KEYWORD

nonn

AUTHOR

Frans Faase (Frans_LiXia(AT)wxs.nl)

EXTENSIONS

Added recurrence from Faase's web page. - N. J. A. Sloane (njas(AT)research.att.com), Feb 03 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 9 18:50 EST 2009. Contains 170568 sequences.


AT&T Labs Research