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 A298361 #13 Feb 11 2018 12:54:14 %S A298361 1,1,1,2,5,14,50,233,1249,7595,49566,339712,2405167,17412878, %T A298361 127855172,947394711 %N A298361 a(n) is the number of maximal simple planar graphs of size n that admit a 2-queue layout. %C A298361 Computed by an exhaustive search. %D A298361 S. Pupyrev, Mixed Linear Layouts of Planar Graphs, International Symposium on Graph Drawing and Network Visualization (GD 2017). %H A298361 Gunnar Brinkmann and Brendan McKay, <a href="http://users.cecs.anu.edu.au/~bdm/plantri">Plantri and fullgen</a>, programs for generation of certain types of planar graph. %H A298361 S. Pupyrev, <a href="https://arxiv.org/abs/1709.00285">Mixed Linear Layouts of Planar Graphs</a>, arXiv:1709.00285 [cs.CG], 2017-2018. %H A298361 Wikipedia, <a href="https://en.wikipedia.org/wiki/Queue_number">Queue number</a>. %e A298361 For n <= 13, all maximal simple planar graphs admit a 2-queue layout; hence, the values are the same as in A000109. %Y A298361 Cf. A000109. %K A298361 nonn,more %O A298361 3,4 %A A298361 _Sergey Pupyrev_, Jan 17 2018