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 A005508 M0755 #23 Feb 23 2021 10:07:19 %S A005508 1,2,3,6,8,18,23,56,70,180,222,594,726,2002,2431,6864,8294,23868, %T A005508 28730,83980,100776,298452,357238,1069776,1277788,3863080,4605980, %U A005508 14040810,16715250,51325650,61020495,188574240,223931910,695987820,825632610,2579248980 %N A005508 Number of unrooted triangulations with reflection symmetry of a disk with one internal node and n+3 nodes on the boundary. %C A005508 These are also called [1,n]-triangulations. %D A005508 C. F. Earl and L. J. March, Architectural applications of graph theory, pp. 327-355 of R. J. Wilson and L. W. Beineke, editors, Applications of Graph Theory. Academic Press, NY, 1979. %D A005508 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A005508 Andrew Howroyd, <a href="/A005508/b005508.txt">Table of n, a(n) for n = 0..1000</a> %H A005508 C. F. Earl and L. J. March, <a href="/A005500/a005500_1.pdf">Architectural applications of graph theory</a>, pp. 327-355 of R. J. Wilson and L. W. Beineke, editors, Applications of Graph Theory. Academic Press, NY, 1979. (Annotated scanned copy) %H A005508 C. F. Earl & N. J. A. Sloane, <a href="/A005500/a005500.pdf">Correspondence, 1980-1981</a> %Y A005508 Row n=1 of the array in A169809. %K A005508 nonn %O A005508 0,2 %A A005508 _N. J. A. Sloane_ %E A005508 Name clarified and terms a(7) and beyond from _Andrew Howroyd_, Feb 22 2021