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 A108508 #8 Feb 16 2025 08:32:58 %S A108508 1,4,12,48,180,528,1392,3600,7920,13680,21840,31872,25008 %N A108508 Number of paths of length n between two arbitrary, distinct vertices in K6, the complete graph on 6 vertices. %H A108508 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CompleteGraph.html">Complete Graph</a>. %e A108508 a(5) = 180 because there are 180 paths of length 5 between two arbitrary, distinct vertices in K6. %Y A108508 Cf. A108506, A108507, A108509. %K A108508 easy,fini,full,nonn %O A108508 1,2 %A A108508 _Ryan Propper_, Jun 06 2005