cp's OEIS Frontend

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.

A241840 Number of simple connected graphs on n nodes that are not distance-regular.

This page as a plain text file.
%I A241840 #18 Feb 16 2025 08:33:22
%S A241840 0,0,1,4,19,108,851,11112,261076,11716564
%N A241840 Number of simple connected graphs on n nodes that are not distance-regular.
%H A241840 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%H A241840 Travis Hoppe and Anna Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644 [math.CO], 2014.
%H A241840 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Distance-RegularGraph.html">Distance-Regular Graph</a>
%F A241840 a(n) = A001349(n) - A241814(n).
%Y A241840 Cf. A001349, A241814.
%K A241840 nonn,less,more
%O A241840 1,4
%A A241840 _Travis Hoppe_ and _Anna Petrone_, Apr 29 2014