login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A020880
Number of strong elementary edge-subgraphs in Moebius ladder M_n.
0
6, 21, 26, 81, 129, 349, 650, 1614, 3281, 7772, 16565, 38265, 83635, 190656, 422266, 955967, 2131986, 4809229, 10764221, 24235939, 54347662, 122246248, 274396853, 616899656, 1385407029
OFFSET
2,1
LINKS
J. P. McSorley, Counting structures in the Moebius ladder, Discrete Math., 184 (1998), 137-164.
FORMULA
Conjectures from Colin Barker, Dec 20 2019: (Start)
G.f.: x^2*(6 + 9*x - 46*x^2 - 22*x^3 + 74*x^4 + 16*x^5 - 38*x^6 - 3*x^7 + 6*x^8) / ((1 - x)*(1 + x)*(1 + x - x^2)*(1 - x - x^2)*(1 - 2*x - x^2 + x^3)).
a(n) = 2*a(n-1) + 5*a(n-2) - 9*a(n-3) - 8*a(n-4) + 12*a(n-5) + 5*a(n-6) - 6*a(n-7) - a(n-8) + a(n-9) for n>10.
(End)
CROSSREFS
Sequence in context: A369969 A229498 A164698 * A046467 A132184 A143322
KEYWORD
nonn,more
EXTENSIONS
a(6)-a(26) from Sean A. Irvine, May 01 2019
STATUS
approved