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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A362894 Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes having Hadwiger number k, 1 <= k <= n. 0
 1, 0, 1, 0, 1, 1, 0, 2, 3, 1, 0, 3, 12, 5, 1, 0, 6, 50, 47, 8, 1, 0, 11, 230, 448, 152, 11, 1 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,8 LINKS Table of n, a(n) for n=1..28. Eric Weisstein's World of Mathematics, Hadwiger Number Wikipedia, Hadwiger number EXAMPLE Triangle begins: 1; 0, 1; 0, 1, 1; 0, 2, 3, 1; 0, 3, 12, 5, 1; 0, 6, 50, 47, 8, 1; 0, 11, 230, 448, 152, 11, 1; CROSSREFS Row sums are A001349. Cf. A084269. Cf. A032766 (n-cocktail party graph). A353212 (n-path complement graph). Sequence in context: A137396 A244213 A346415 * A352067 A368486 A178245 Adjacent sequences: A362891 A362892 A362893 * A362895 A362896 A362897 KEYWORD nonn,tabl,hard,more AUTHOR Peter Kagey, May 08 2023 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 February 23 11:05 EST 2024. Contains 370283 sequences. (Running on oeis4.)