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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A020881 Number of strong restricted edge-subgraphs in Moebius ladder M_n. 1
18, 102, 418, 2006, 8946, 41222, 187202, 855606, 3899538, 17794662, 81157858, 370232726, 1688782386, 7703577542, 35140060802, 160293673206, 731187195858 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,1

LINKS

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

Sean A. Irvine, Java program (github)

J. P. McSorley, Counting structures in the Moebius ladder, Discrete Math., 184 (1998), 137-164.

FORMULA

For large n, (3.2143)^n < a(n) < (6.4188)^n (Th. 23.1.) - C. Ronaldo (aga_new_ac(AT)hotmail.com), Jan 17 2005

Conjectures from Colin Barker, Dec 20 2019: (Start)

G.f.: 2*x^2*(9 + 33*x + 8*x^2 - 12*x^3) / ((1 + x)*(1 + 2*x)*(1 - 5*x + 2*x^2)).

a(n) = 2*a(n-1) + 11*a(n-2) + 4*a(n-3) - 4*a(n-4) for n>5.

(End)

CROSSREFS

Sequence in context: A107600 A229326 A008528 * A285043 A223241 A197339

Adjacent sequences:  A020878 A020879 A020880 * A020882 A020883 A020884

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane.

EXTENSIONS

a(6)-a(18) from Sean A. Irvine, Apr 30 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 November 29 18:07 EST 2020. Contains 338769 sequences. (Running on oeis4.)