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.

A343869 Number of unlabeled nonseparable (or 2-connected) planar graphs with n edges.

This page as a plain text file.
%I A343869 #29 Jun 24 2023 13:41:26
%S A343869 1,0,1,1,2,4,7,16,41,108,320,1042,3575,13064,49938,197729,805991,
%T A343869 3363084,14302891,61813285,270805177,1200460492,5376709415,
%U A343869 24302430375,110745093999,508380790741
%N A343869 Number of unlabeled nonseparable (or 2-connected) planar graphs with n edges.
%C A343869 Terms may be computed using the tools geng and planarg in nauty.
%H A343869 Brendan McKay and Adolfo Piperno, <a href="http://pallini.di.uniroma1.it/">nauty and Traces</a>
%o A343869 (nauty)
%o A343869 # count graphs for the sequence by number of vertices v, sum over v afterwards
%o A343869 geng -C $v $n:$n | planarg -q | countg -q # _Georg Grasegger_, Jun 05 2023
%Y A343869 Row sums of A343870.
%Y A343869 Column sums of A049336(n > 1).
%Y A343869 Cf. A002840 (3-connected), A010355, A021103, A046091, A289471, A291841.
%K A343869 nonn,more
%O A343869 1,5
%A A343869 _Andrew Howroyd_, May 04 2021
%E A343869 a(21)-a(26) added by _Georg Grasegger_, Jun 05 2023