This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A116079 #18 Aug 15 2019 16:49:26 %S A116079 0,0,0,0,1,2,15,85,650,5800,65243,931258,17182237,414512599, %T A116079 13161989059 %N A116079 Number of connected triangle-free graphs on n nodes with chromatic number 3. %H A116079 Keith M. Briggs, <a href="http://keithbriggs.info/cgt.html">Combinatorial Graph Theory</a> %e A116079 Table of number of connected triangle-free graphs on n nodes with chromatic number k begins: %e A116079 (The first row is the same as the number of connected bipartite graphs on n nodes, A005142) %e A116079 n=...1...2...3...4...5....6....7.....8.....9.....10......11.......12.........13 %e A116079 k.----------------------------------------------------------------------------- %e A116079 2|...0...1...1...3...5...17...44...182...730...4032...25598...212780....2241730 (A005142) %e A116079 3|...0...0...0...0...1....2...15....85...650...5800...65243...931258...17182237 (the present sequence) %e A116079 4|...0...0...0...0...0....0....0.....0.....0......0.......1.......23.......1085 (A126741) %K A116079 nonn %O A116079 1,6 %A A116079 _N. J. A. Sloane_, based on email from _Keith Briggs_, Mar 21 2006 %E A116079 a(14) from _Michael Sollami_, Jan 29 2012 %E A116079 a(15) from _Michael Sollami_, Feb 04 2012