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 A333163 #7 Mar 12 2020 19:00:41 %S A333163 1,0,0,1,3,4,12,24,70,172,525,1530,5078,16994,61456,228898,895910, %T A333163 3617148,15130833,65084088,287828488,1304327221,6050218591, %U A333163 28675928883,138730847262,684300453848,3438439910436,17585597712632,91479580896616,483699938173293,2598090378779507 %N A333163 Number of cubic graphs on n unlabeled nodes with half-edges. %C A333163 A half-edge is like a loop except it only adds 1 to the degree of its vertex. %C A333163 a(n) is the number of simple graphs on n unlabeled nodes with every node having degree 2 or 3. %Y A333163 Column k=3 of A333161. %Y A333163 Cf. A005638, A110040, A186417. %K A333163 nonn %O A333163 0,5 %A A333163 _Andrew Howroyd_, Mar 11 2020