OFFSET
1,1
COMMENTS
For n > 2, a(n) is the number of connected minimal dominating sets in the n-Andrasfai graph.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Andrasfai Graph.
Eric Weisstein's World of Mathematics, Connected Graph.
Eric Weisstein's World of Mathematics, Minimum Dominating Set.
Index entries for linear recurrences with constant coefficients, signature (6,-15,20,-15,6,-1).
FORMULA
a(n) = 6*a(n-1)-15*a(n-2)+20*a(n-3)-15*a(n-4)+6*a(n-5)-a(n-6).
G.f.: x*(5-24*x+51*x^2-49*x^3+14*x^4+6*x^5)/(-1+x)^6.
E.g.f.: 6 + exp(x)*(x^5/40 - 5*x^4/24 + 5*x^3/2 - 5*x^2 + 11*x - 6). - Stefano Spezia, Feb 17 2025
MATHEMATICA
Table[(3 n - 1) (n^4 - 18 n^3 + 179 n^2 - 582 n + 720)/120, {n, 20}]
LinearRecurrence[{6, -15, 20, -15, 6, -1}, {5, 6, 12, 33, 77, 153}, 20]
CoefficientList[Series[(5 - 24 x + 51 x^2 - 49 x^3 + 14 x^4 + 6 x^5)/(-1 + x)^6, {x, 0, 20}], x]
PROG
(Python)
def A381193(n): return n*(n*(n*(n*(3*n - 55) + 555) - 1925) + 2742)//120-6 # Chai Wah Wu, Feb 16 2025
(Magma) [(3*n-1)*(n^4-18*n^3+179*n^2-582*n+720)/120: n in [1..50]]; // Vincenzo Librandi, Mar 03 2025
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Eric W. Weisstein, Feb 16 2025
STATUS
approved
