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 A290814 #36 Sep 20 2018 10:53:13 %S A290814 0,0,0,0,0,1,25,929,54957,4880093,650856040 %N A290814 Number of non-word-representable connected graphs on n vertices. %C A290814 A simple graph G=(V,E) is word-representable if there exists a word w over the alphabet V such that letters x and y alternate in w iff xy is an edge in E. Word-representable graphs generalize several important classes of graphs. - _Sergey Kitaev_, Sep 19 2018 %H A290814 Ozgur Akgun, Ian P. Gent, Sergey Kitaev, Hans Zantema, <a href="https://arxiv.org/abs/1808.01215">Solving computational problems in the theory of word-representable graphs</a>, arXiv:1808.01215 [math.CO], 2018. %H A290814 Sergey Kitaev, <a href="https://arxiv.org/abs/1705.05924">A comprehensive introduction to the theory of word-representable graphs</a>, arXiv:1705.05924 [math.CO], 2017. %e A290814 The wheel graph W_5 is the only connected graph on 6 vertices that is not word-representable. %K A290814 nonn,more %O A290814 1,7 %A A290814 _Eric Rowland_, Aug 11 2017 %E A290814 a(11) from _Sergey Kitaev_, Sep 19 2018 %E A290814 a(9) corrected by _Sergey Kitaev_, Sep 20 2018