This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A284710 #16 Feb 16 2025 08:33:43
%S A284710 3,3,6,23,43,102,213,447,978,2083,4491,9650,20699,44495,95536,205215,
%T A284710 440813,946758,2033611,4367943,9381882,20151431,43283105,92967858,
%U A284710 199685543,428904271,921243300,1978737343
%N A284710 Number of maximal matchings in the n-Moebius ladder.
%C A284710 Recurrence used to extrapolate to a(1) and a(2).
%H A284710 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Matching.html">Matching</a>
%H A284710 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MaximalIndependentEdgeSet.html">Maximal Independent Edge Set</a>
%H A284710 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MoebiusLadder.html">Moebius Ladder</a>
%H A284710 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (1, 2, 1, -1, 2, 1, -1, -1).
%F A284710 a(n) = a(n-1)+2*a(n-2)+a(n-3)-a(n-4)+2*a(n-5)+a(n-6)-a(n-7)-a(n-8).
%F A284710 G.f.: x*(3-3*x^2+8*x^3+8*x^4+4*x^5-x^6-2*x^7)/(1-x-2*x^2-x^3+x^4-2*x^5-x^6+x^7+x^8).
%t A284710 LinearRecurrence[{1, 2, 1, -1, 2, 1, -1, -1}, {3, 3, 6, 23, 43, 102, 213, 447, 978}, 30]
%t A284710 Table[2 Cos[n Pi/3] + RootSum[-1 - 2 # - #^2 + #^3 &, #^n &] - RootSum[-1 + #^2 + #^3 &, #^n &], {n, 3, 20}]
%K A284710 nonn,easy
%O A284710 1,1
%A A284710 _Eric W. Weisstein_, Apr 01 2017