The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A309018 Number of perfect matchings in the graph C_{12} X C_n. 4
 24200, 7379216, 41934482, 4357599552, 55820091938, 3827188349968, 69206906601800, 3876306765700644, 83804387156528018, 4161957566985310208, 100644292294423977842, 4601436044608986037284, 120511830300023778605000, 5179981855242249681088528, 144148769049390803580105218 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,1 COMMENTS This sequence satisfies a recurrence relation of order 266. LINKS Seiichi Manyama, Table of n, a(n) for n = 3..500 S. N. Perepechko, The number of perfect matchings on C_m X C_n graphs, (in Russian), Information Processes, 2016, V. 16, No. 4, pp. 333-361. Sergey Perepechko, Generating function in Maple notation. CROSSREFS Row n=6 of A341741. Cf. A230033, A231485, A232804, A253678, A281583, A281679, A308761. Sequence in context: A234112 A234165 A321063 * A253465 A251154 A078870 Adjacent sequences: A309015 A309016 A309017 * A309019 A309020 A309021 KEYWORD nonn AUTHOR Sergey Perepechko, Jul 06 2019 STATUS approved

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

Last modified December 5 23:11 EST 2023. Contains 367594 sequences. (Running on oeis4.)