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.

Showing 1-5 of 5 results.

A241711 Erroneous version of A128240.

Original entry on oeis.org

0, 0, 1, 3, 15, 93, 792, 10833, 259420, 11704309
Offset: 1

Views

Author

Travis Hoppe and Anna Petrone, Apr 27 2014

Keywords

Comments

Number of simple connected graphs with n nodes and girth 3.
See history for details on why this sequence is erroneous.

Links

Crossrefs

Cf. other simple connected graphs of girth k, A241712, A241713, A241714, A241715.

A243245 Duplicate of A128240.

Original entry on oeis.org

0, 0, 1, 3, 15, 93, 794, 10850, 259700, 11706739
Offset: 1

Views

Author

Keywords

A128042 Triangle read by columns: number of n-node (unlabeled) connected graphs with girth k, for n >= 3, k >= 3.

Original entry on oeis.org

1, 3, 1, 15, 2, 1, 93, 11, 1, 1, 794, 41, 5, 1, 1, 10850, 220, 16, 6, 1, 1, 259700, 1243, 66, 17, 5, 1, 1, 11706739, 9368, 266, 69, 15, 6, 1, 1, 1006609723, 89049, 1235, 239, 58, 18, 6, 1, 1, 164058686415, 1135894, 6350, 962, 202, 74, 19, 7, 1, 1
Offset: 3

Views

Author

Keith Briggs, May 05 2007

Keywords

Examples

			Number of n-node (unlabeled) connected graphs with girth k:
.k..|.n=........3........4........5........6........7........8........9........10
---------------------------------------------------------------------------------
.0..|...........0........0........0........0........0........0........0.........0
.1..|...........0........0........0........0........0........0........0.........0
.2..|...........0........0........0........0........0........0........0.........0
.3..|...........1........3.......15.......93......794....10850...259700..11706739
.4..|...........0........1........2.......11.......41......220.....1243......9368
.5..|...........0........0........1........1........5.......16.......66.......266
.6..|...........0........0........0........1........1........6.......17........69
.7..|...........0........0........0........0........1........1........5........15
.8..|...........0........0........0........0........0........1........1.........6
.9..|...........0........0........0........0........0........0........1.........1
10..|...........0........0........0........0........0........0........0.........1
11..|...........0........0........0........0........0........0........0.........0

Links

Crossrefs

Sequences for k=3..6 are A128240, A128241, A128242, A128243.
Cf. A128041, A006787, A128236, A128237, A128238, A128239.
Cf. A325455 (circumference).

Programs

Extensions

Corrected and extended by Martin Fuller, May 01 2015

A128243 Number of n-node (unlabeled) connected graphs with girth 6.

Original entry on oeis.org

0, 0, 0, 1, 1, 6, 17, 69, 239, 962, 3864, 17049, 79607, 403758, 2209386, 13138818, 84841130, 595825731
Offset: 3

Views

Author

Keith Briggs, May 05 2007

Keywords

Crossrefs

Cf. A128041, A128042.
Cf. A128236, A128237, A128238, A128239, A128240, A128241, A128242.

Programs

  • nauty
    geng -ctfq $n | countg -qg6 --ng # Martin Fuller, May 03 2015

Extensions

Corrected and extended by Martin Fuller, May 01 2015
a(18)-a(20) added by Georg Grasegger, May 02 2023

A128242 Number of n-node (unlabeled) connected graphs with girth 5.

Original entry on oeis.org

0, 0, 1, 1, 5, 16, 66, 266, 1235, 6350, 37364, 251106, 1942085, 17287710, 177086792, 2084120446, 28125888087, 434318629496, 7657513894860
Offset: 3

Views

Author

Keith Briggs, May 05 2007

Keywords

Crossrefs

Cf. A128041, A128042.
Cf. A128236, A128237, A128238, A128239, A128240, A128241, A128243.

Programs

  • nauty
    geng -ctfq $n | countg -qg5 --ng # Martin Fuller, May 03 2015

Extensions

Corrected and extended by Martin Fuller, May 01 2015
a(18)-a(21) added by Georg Grasegger, May 02 2023
Showing 1-5 of 5 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.