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 A319490 #11 Sep 28 2018 10:17:00 %S A319490 0,0,0,0,0,1,39,1852,88838 %N A319490 Number of non-isomorphic connected graphs on n vertices with representation number 3. %C A319490 These are graphs that can be represented by words having three copies of each letter, but cannot be represented by words having two copies of each letter. In a word representing a graph G, letters x and y alternate if any only if there is an edge between x and y in G. %H A319490 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 A319490 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 A319490 The triangular prism is the only graph on 6 vertices that can be represented using three copies of each letter, but cannot be represented using 2 copies of each letter. %Y A319490 Cf. A319489 (graphs with representation number 2). %K A319490 nonn,more %O A319490 1,7 %A A319490 _Sergey Kitaev_, Sep 20 2018