close
login
A392590
Upper irredundance and domination number of the n-Moebius ladder.
0
1, 1, 3, 4, 5, 5, 7, 8, 9, 9, 11, 12, 13, 13, 15, 16, 17, 17, 19, 20, 21, 21, 23, 24, 25, 25, 27, 28, 29, 29, 31, 32, 33, 33, 35, 36, 37, 37, 39, 40, 41, 41, 43, 44, 45, 45, 47, 48, 49, 49, 51, 52, 53, 53, 55, 56, 57, 57, 59, 60, 61, 61, 63, 64, 65, 65, 67
OFFSET
1,3
COMMENTS
Extended to a(1)-a(2) using the formula.
LINKS
Eric Weisstein's World of Mathematics, Moebius Ladder.
Eric Weisstein's World of Mathematics, Upper Domination Number.
Eric Weisstein's World of Mathematics, Upper Irredundance Number.
FORMULA
a(n) = (4*n + 2*cos(n*Pi/2) - 1 - (-1)^n)/4.
G.f.: x*(1+2*x^2+x^3)/((-1+x)^2*(1+x+x^2+x^3)).
a(n) = a(n-1)+a(n-4)-a(n-5).
E.g.f.: (cos(x) + (2*x - 1)*cosh(x) + 2*x*sinh(x))/2. - Stefano Spezia, Jan 17 2026
MATHEMATICA
Table[(4 n + 2 Cos[n Pi/2] - 1 - (-1)^n)/4, {n, 20}]
Table[4 + Floor[(n - 5)/4] + 2 Floor[(n - 3)/4] + Floor[n/4], {n, 20}]
LinearRecurrence[{1, 0, 0, 1, -1}, {1, 1, 3, 4, 5}, 20]
CoefficientList[Series[(1 + 2 x^2 + x^3)/((-1 + x)^2 (1 + x + x^2 + x^3)), {x, 0, 20}], x]
CROSSREFS
Sequence in context: A229445 A323743 A261017 * A024357 A300778 A199084
KEYWORD
nonn,easy
AUTHOR
Eric W. Weisstein, Jan 17 2026
STATUS
approved