|
|
|
|
|
|
|
|
|
#26 by Ray Chandler at Sun Mar 03 10:09:43 EST 2024
|
|
|
|
|
|
|
|
#25 by Ray Chandler at Sun Mar 03 10:09:39 EST 2024
|
|
| LINKS
|
<a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (56, -672, 2632, -4094, 2632, -672, 56, -1).
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#24 by N. J. A. Sloane at Tue Jan 01 06:31:05 EST 2019
|
|
| LINKS
|
F. Faase, <a href="http://www.iwriteiam.nl/counting.html">Counting HamiltonHamiltonian cycles in product graphs</a>
|
|
|
|
|
Discussion
|
| Tue Jan 01
| 06:31
| OEIS Server: https://oeis.org/edit/global/2784
|
|
|
|
|
|
|
#23 by Bruno Berselli at Mon Aug 20 03:12:43 EDT 2018
|
|
|
|
|
|
|
|
#22 by Joerg Arndt at Mon Aug 20 03:11:28 EDT 2018
|
|
|
|
|
|
|
|
#21 by Jean-François Alcover at Mon Aug 20 02:05:53 EDT 2018
|
|
|
|
|
|
|
|
#20 by Jean-François Alcover at Mon Aug 20 02:05:44 EDT 2018
|
|
| MATHEMATICA
|
a[n_] := Product[2(2+Cos[k Pi/4]+Cos[2j Pi/(2n+1)]), {k, 1, 3}, {j, 1, n}] // Round;
Table[a[n], {n, 0, 14}] (* Jean-François Alcover, Aug 20 2018 *)
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#19 by R. J. Mathar at Thu Dec 19 05:42:55 EST 2013
|
|
|
|
|
|
|
|
#18 by R. J. Mathar at Thu Dec 19 05:42:52 EST 2013
|
|
| REFERENCES
|
Per Hakan Lundow, "Computation of matching polynomials and the number of 1-factors in polygraphs", Research report, No 12, 1996, Department of Math., Umea University, Sweden.
|
|
| LINKS
|
Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors.pdf">Computation of matching polynomials and the number of 1-factors in polygraphs</a>, Research report, No 12, 1996, Department of Math., Umea University, Sweden.
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#17 by Alois P. Heinz at Mon Dec 09 18:29:38 EST 2013
|
|
|
|
|
|
|
