This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A126744 Triangle read by rows: T(n,k) (n>=2, k=0..n-2) gives number of connected graphs on n nodes with clique number n-k. 7
 1, 1, 1, 1, 2, 3, 1, 3, 11, 6, 1, 4, 25, 63, 19, 1, 5, 45, 266, 477, 59, 1, 6, 73, 785, 4646, 5339, 267, 1, 7, 109, 1908, 26205, 136935, 94535, 1380, 1, 8, 155, 4085, 110140, 1696407, 7121703, 2774240, 9832 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 2,5 LINKS Keith M. Briggs, Combinatorial Graph Theory EXAMPLE Triangle begins: n=...1...2...3...4....5....6.....7......8........9........10 k.------------------------------------------------------------ 2|...0...1...1...3....6...19....59....267.....1380......9832 = A024607 3|...0...0...1...2...11...63...477...5339....94535...2774240 = A126745 4|...0...0...0...1....3...25...266...4646...136935...7121703 = A126746 5|...0...0...0...0....1....4....45....785....26205...1696407 = A126747 6|...0...0...0...0....0....1.....5.....73.....1908....110140 = A126748 7|...0...0...0...0....0....0.....1......6......109......4085 = A217987 8|...0...0...0...0....0....0.....0......1........7.......155 CROSSREFS Diagonals give A024607, A126745-A126748, A217987. Sequence in context: A145080 A065078 A203989 * A122078 A126736 A253257 Adjacent sequences:  A126741 A126742 A126743 * A126745 A126746 A126747 KEYWORD nonn,tabl,hard,more AUTHOR N. J. A. Sloane, Feb 18 2007 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.

Last modified September 20 03:54 EDT 2019. Contains 327210 sequences. (Running on oeis4.)