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.
\\ Needs G function from A138107. a(n)={if(n==0, 1, my(m=2*n); polcoef(G(3*n, x + O(x*x^m)) - G(3*n-1, x + O(x*x^m)), m))} \\ Andrew Howroyd, Apr 20 2020
For n=2 we have two edges and two vertices, for a total of six graphs: * one vertex with two loops attached to it * one loop attached to each vertex * two vertices linked by two edges in opposite directions * two vertices linked by two edges in the same direction * one vertex with a loop being pointed at * one vertex with a loop being pointed away from.
Comments