login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A302918 Number of nonequivalent minimal total dominating sets in the n-cycle graph up to rotation. 1
0, 0, 1, 1, 1, 2, 1, 1, 2, 3, 2, 4, 3, 4, 6, 7, 7, 10, 11, 17, 19, 23, 28, 38, 46, 60, 75, 96, 120, 160, 197, 257, 327, 420, 539, 701, 892, 1155, 1488, 1928, 2479, 3220, 4148, 5381, 6961, 9030, 11687, 15183, 19673, 25563, 33174, 43128, 56010, 72864, 94719 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

LINKS

Table of n, a(n) for n=1..55.

Eric Weisstein's World of Mathematics, Cycle Graph

Eric Weisstein's World of Mathematics, Total Dominating Set

FORMULA

a(n) = (1/n) * Sum_{d|n} phi(n/d) * A300738(d).

PROG

(PARI)

NecklaceT(v)={vector(#v, n, sumdiv(n, d, eulerphi(n/d)*v[d])/n)}

NecklaceT(concat([0, 0], Vec((3 + 4*x + 5*x^2 + 6*x^3 - 8*x^5 - 9*x^6)/((1 - x^2 - x^3)*(1 + x^2 - x^6)) + O(x^50))))

CROSSREFS

Cf. A300738.

Sequence in context: A087917 A087741 A054991 * A316149 A047071 A124287

Adjacent sequences:  A302915 A302916 A302917 * A302919 A302920 A302921

KEYWORD

nonn

AUTHOR

Andrew Howroyd, Apr 15 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 16 17:32 EST 2018. Contains 317275 sequences. (Running on oeis4.)