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 A374261 #13 Jul 10 2024 23:58:02 %S A374261 3,4,5,5,6,7,7,7,8,9,9,9,10,10,10,10,10,10,10,11 %N A374261 Edge-distinguishing chromatic number of the triangular ladder graph with n vertices. %D A374261 O. Frank, F. Harary, and M. J. Plantholt, The line-distinguishing chromatic number of a graph, pp. 14, 241-252 of Ars Combinatoria (1982). %H A374261 K. Al-Wahabi, R. Bari, F. Harary and D. Ullman, <a href="http://dx.doi.org/10.1016/S0167-5060(08)70446-1">The edge-distinguishing chromatic number of paths and cycles</a>, pp. 17-22 of Graph Theory in Memory of G. A. Dirac (Sandbjerg, 1985). Edited by L. D. Andersen et al., Annals of Discrete Mathematics, 41. North-Holland Publishing Co., Amsterdam-New York, 1989. %e A374261 The first few triangular ladder graphs are illustrated below: %e A374261 o o---o o---o o---o---o %e A374261 / \ / \ / / \ / \ / \ / \ / %e A374261 o---o o---o o---o---o o---o---o %Y A374261 Cf. A006670, A278375. %K A374261 nonn,more %O A374261 3,1 %A A374261 _Cooper Burkel_, Jul 01 2024