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.

Original entry on oeis.org

1, 1, 1, 2, 6, 21, 112, 697, 6386, 75700, 1156842, 21503340, 471142472, 11851753163, 336605142326, 10661879669294, 373171677147769, 14326039970010402, 599529134063451455, 27206654007549974712, 1332697569146848014994, 70181910345392508318643, 3959059626001669328959513
Offset: 0

Views

Author

Natan Arie Consigli, Jun 04 2018

Keywords

Crossrefs

Cf. A303031 (also counts double edged graphs), A303033 (at most triple edges).
Cf. A121941 (degree 4 or less), A243393 (degree 3 or less).

Programs

  • nauty
    for n in {1..12}; do geng -c -D5 ${n} -u; done

Extensions

a(13)-a(22) from Andrew Howroyd, Mar 20 2020