STATUS
reviewed
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A020879
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing entries 1-10 | older changes
STATUS
proposed
reviewed
STATUS
editing
proposed
FORMULA
Conjectures from Colin Barker, Dec 20 2019: (Start)
G.f.: x^2*(17 - 10*x - 85*x^2 - 51*x^3 + 10*x^4 + 7*x^5) / ((1 + x)*(1 - 2*x - x^2)*(1 - 3*x - 2*x^2 + x^3)).
a(n) = 4*a(n-1) + 2*a(n-2) - 11*a(n-3) - 8*a(n-4) + a(n-5) + a(n-6) for n>7.
(End)
STATUS
approved
editing
STATUS
proposed
approved
STATUS
editing
proposed
KEYWORD
nonn,easy,changed
DATA
17, 58, 181, 602, 2006, 6797, 23205, 79771, 275462, 954367, 3314074, 11526782, 40136519, 139865123, 487656165, 1700907382, 5934174209, 20707036102, 72265263946, 252219473921, 880346196329, 3072884622527, 10726335768378, 37442520667627, 130702738526702
LINKS
Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a020/A020879
KEYWORD
nonn,easy,more
EXTENSIONS
a(6)-a(26) from Sean A. Irvine, May 01 2019
STATUS
approved
editing
STATUS
editing
approved
REFERENCES
J. P. McSorley, Counting structures in the Moebius ladder, Discrete Math., 184 (1998), 137-164.
LINKS
J. P. McSorley, <a href="http://dx.doi.org/10.1016/S0012-365X(97)00086-1">Counting structures in the Moebius ladder</a>, Discrete Math., 184 (1998), 137-164.
STATUS
approved
editing