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.

A283421 Number of connected untraceable graphs on n vertices.

This page as a plain text file.
%I A283421 #13 Feb 16 2025 08:33:42
%S A283421 0,0,0,1,3,21,119,1087,12653,233999,6469055
%N A283421 Number of connected untraceable graphs on n vertices.
%H A283421 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ConnecetedGraph.html">Connected Graph</a>
%H A283421 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/UntraceableGraph.html">Untraceable Graph</a>
%F A283421 a(n) = A001349(n) - A057864(n).
%Y A283421 Cf. A000088 (number of simple graphs on n vertices).
%Y A283421 Cf. A001349 (number of simple connected graphs on n vertices).
%Y A283421 Cf. A057864 (number of traceable simple graphs on n vertices).
%Y A283421 Cf. A283420 (number of simple untraceable not necessarily connected graphs on n vertices).
%K A283421 nonn,more
%O A283421 1,5
%A A283421 _Eric W. Weisstein_, May 14 2017