login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A303143 Number of minimum total dominating sets in the n-transposition graph. 3
0, 1, 9, 784 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

a(n) matches all 4 terms of the finite sequence A168257(n).

a(n) matches A060545(n-1)^2 for n=2 to 4.

LINKS

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

Eric Weisstein's World of Mathematics, Total Dominating Set

Eric Weisstein's World of Mathematics, Transposition Graph

CROSSREFS

Cf. A303150 (set size), A321618, A303146.

Sequence in context: A246126 A091057 A168257 * A137065 A272853 A332179

Adjacent sequences:  A303140 A303141 A303142 * A303144 A303145 A303146

KEYWORD

nonn,more

AUTHOR

Eric W. Weisstein, Apr 19 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 2 05:01 EST 2021. Contains 349437 sequences. (Running on oeis4.)