The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A286958 Triangle read by rows: T(n,k) is the number of graphs with n vertices with connected domination number k. 2
 1, 1, 2, 4, 2, 11, 8, 2, 34, 62, 14, 2, 156, 514, 163, 18, 2, 1044, 7147, 2583, 317, 24, 2, 12346, 170803, 70667, 6720, 513, 29, 2, 274668, 7613603, 3566498, 247454, 13525, 785, 36, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Table of n, a(n) for n=1..38. Eric Weisstein's World of Mathematics, Connected Domination Number. EXAMPLE Triangle begins: 1; 1; 2; 4, 2; 11, 8, 2; 34, 62, 14, 2; 156, 514, 163, 18, 2; ... CROSSREFS Row sums are A001349. Column k=1 is A000088(n-1). Cf. A263284, A332400, A332401. Sequence in context: A320971 A360667 A342828 * A332401 A125755 A118921 Adjacent sequences: A286955 A286956 A286957 * A286959 A286960 A286961 KEYWORD nonn,tabf,more AUTHOR Eric W. Weisstein, May 17 2017 STATUS approved

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

Last modified September 10 17:09 EDT 2024. Contains 375792 sequences. (Running on oeis4.)