login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,1

LINKS

Table of n, a(n) for n=2..26.

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: A327865 A229498 A164698 * A046467 A132184 A143322

Adjacent sequences:  A020877 A020878 A020879 * A020881 A020882 A020883

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane

EXTENSIONS

a(6)-a(26) from Sean A. Irvine, May 01 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 12 03:34 EDT 2020. Contains 336436 sequences. (Running on oeis4.)