|
| |
|
|
A347525
|
|
Number of minimum dominating sets in the n-Andrásfai graph.
|
|
1
|
|
|
|
2, 5, 24, 22, 28, 34, 40, 46, 52, 58, 64, 70, 76, 82, 88, 94, 100, 106, 112, 118, 124, 130, 136, 142, 148, 154, 160, 166, 172, 178, 184, 190, 196, 202, 208, 214, 220, 226, 232, 238, 244, 250, 256, 262, 268, 274, 280, 286, 292, 298, 304, 310, 316, 322, 328, 334
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
|
|
|
FORMULA
|
a(n) = A016957(n-1) = 2*(3*n-1) for n > 3.
G.f.: x*(2 + x + 16*x^2 - 21*x^3 + 8*x^4)/(-1 + x)^2.
|
|
|
MATHEMATICA
|
LinearRecurrence[{2, -1}, {2, 5, 24, 22, 28}, 100] (* Paolo Xausa, Sep 01 2023 *)
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,easy
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
