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 A296621 #11 Dec 19 2017 18:40:09 %S A296621 1,0,3,0,60,0,5457,2391,0,258474,3200871,37,1,0,1041762,2583730089, %T A296621 364670,154,0 %N A296621 Number of 5-regular (quintic) connected graphs on 2*n nodes with diameter k written as irregular triangle T(n,k). %C A296621 The results were found by applying the Floyd-Warshall algorithm to the output of Markus Meringer's GenReg program. %H A296621 M. Meringer, <a href="https://sourceforge.net/projects/genreg/">GenReg</a>, Generation of regular graphs. %H A296621 Wikipedia, <a href="https://en.wikipedia.org/wiki/Distance_(graph_theory)">Distance (graph theory).</a> %H A296621 Wikipedia, <a href="https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm">Floyd-Warshall algorithm.</a> %e A296621 Triangle begins: %e A296621 Diameter %e A296621 n/ 1 2 3 4 5 %e A296621 6: 0 1 %e A296621 8: 0 3 %e A296621 10: 0 60 %e A296621 12: 0 5457 2391 %e A296621 14: 0 258474 3200871 37 1 %e A296621 16: 0 1041762 2583730089 364670 154 %e A296621 . %e A296621 The adjacency matrix of the unique 5-regular graph on 14 nodes with diameter 5 is provided as example in A296526. %Y A296621 Cf. A006821 (row sums), A068934, A204329, A296525 (number of terms in each row), A296526, A296620. %K A296621 nonn,tabf,more %O A296621 3,3 %A A296621 _Hugo Pfoertner_, Dec 19 2017