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.

A303032 Number of unlabeled connected graphs with n nodes of degree 5 or less.

This page as a plain text file.
%I A303032 #16 Jun 02 2025 17:24:39
%S A303032 1,1,1,2,6,21,112,697,6386,75700,1156842,21503340,471142472,
%T A303032 11851753163,336605142326,10661879669294,373171677147769,
%U A303032 14326039970010402,599529134063451455,27206654007549974712,1332697569146848014994,70181910345392508318643,3959059626001669328959513
%N A303032 Number of unlabeled connected graphs with n nodes of degree 5 or less.
%o A303032 (nauty) for n in {1..12}; do geng -c -D5 ${n} -u; done
%Y A303032 Cf. A303031 (also counts double edged graphs), A303033 (at most triple edges).
%Y A303032 Cf. A121941 (degree 4 or less), A243393 (degree 3 or less).
%K A303032 nonn
%O A303032 0,4
%A A303032 _Natan Arie Consigli_, Jun 04 2018
%E A303032 a(13)-a(22) from _Andrew Howroyd_, Mar 20 2020