login

Revision History for A298198

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Number of Eulerian cycles in the graph Cartesian product of C_n and a double edge.
(history; published version)
#16 by Ray Chandler at Tue Jul 04 13:58:25 EDT 2023
STATUS

editing

approved

#15 by Ray Chandler at Tue Jul 04 13:58:21 EDT 2023
LINKS

<a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (14, -60, 72).

STATUS

approved

editing

#14 by Joerg Arndt at Sun Oct 06 01:50:48 EDT 2019
STATUS

reviewed

approved

#13 by Michel Marcus at Sun Oct 06 01:05:38 EDT 2019
STATUS

proposed

reviewed

#12 by Andrew Howroyd at Sat Oct 05 23:09:33 EDT 2019
STATUS

editing

proposed

#11 by Andrew Howroyd at Sat Oct 05 23:08:15 EDT 2019
LINKS

Andrew Howroyd, <a href="/A298198/b298198.txt">Table of n, a(n) for n = 1..500</a>

STATUS

approved

editing

#10 by Bruno Berselli at Sat Mar 31 16:59:13 EDT 2018
STATUS

proposed

approved

#9 by Jon E. Schoenfield at Sat Mar 31 13:53:38 EDT 2018
STATUS

editing

proposed

#8 by Jon E. Schoenfield at Sat Mar 31 13:53:35 EDT 2018
NAME

Number of Eulerian cycles in the graph cartesian Cartesian product of C_n and a double edge.

COMMENTS

When n = 2 the graph is the cartesian Cartesian product of two double edges.

STATUS

approved

editing

#7 by Susanna Cuyler at Sun Jan 14 18:25:37 EST 2018
STATUS

proposed

approved