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-3 of 3 results.

A076435 Number of strongly regular simple graphs on n nodes.

Original entry on oeis.org

1, 2, 2, 4, 3, 6, 2, 6, 5, 8, 2, 10, 3, 6
Offset: 1

Views

Author

Eric W. Weisstein, Oct 11 2002

Keywords

Examples

			1: K_1 (1 graph)
2: \bar K_2, P_2 = K_2 (2 graph)
3: \bar K_3, C_3 = K_3 (2 graphs)
4: \bar K_4, 2P_2, C_4, K_4 (4 graphs)
5: C_5, \bar K_5, K_5 (3 graphs)
6: 2C_3, K_6, \bar K_6, 3P_2, Ci_6(1,2), K_{3,3} (6 graphs)
Here, \bar denotes the graph complement and Ci_n(...) a circular graph.

Links

Crossrefs

Cf. A005176, A076434, A088741.

Extensions

a(10) from Eric W. Weisstein, Oct 30 2017
a(11)-a(14) from Sean A. Irvine, Sep 11 2021

A294405 Number of connected weakly regular graphs on n nodes.

Original entry on oeis.org

0, 0, 0, 0, 0, 2, 3, 14, 19, 162
Offset: 1

Views

Author

Eric W. Weisstein, Oct 30 2017

Keywords

Links

Crossrefs

Cf. A005177 (connected regular graphs).
Cf. A076434 (not-necessarily connected weakly regular graphs).
Cf. A088741 (connected strongly regular graphs).

Formula

a(n) = A005177(n) - A088741(n). - Andrew Howroyd, Sep 03 2019

A051427 Number of strictly Deza graphs with n nodes.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 3, 2, 1, 0, 6, 1, 1, 1
Offset: 1

Views

Author

N. J. A. Sloane

Keywords

Comments

From the Erikson et al. paper: We consider the following generalization of strongly regular graphs. A graph G is a Deza graph if it is regular and the number of common neighbors of two distinct vertices takes on one of two values (not necessarily depending on the adjacency of the two vertices). - Jonathan Vos Post, Jul 06 2008

Links

Crossrefs

Cf. A005176, A076434, A076435, A088741.

Extensions

a(14)-a(15) from Sean A. Irvine, Sep 18 2021
Showing 1-3 of 3 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.