login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A294405 Number of connected weakly regular graphs on n nodes. 2
0, 0, 0, 0, 0, 2, 3, 14, 19, 162 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

LINKS

Table of n, a(n) for n=1..10.

Eric Weisstein's World of Mathematics, Connected Graph

Eric Weisstein's World of Mathematics, Weakly Regular Graph

FORMULA

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

CROSSREFS

Cf. A005177 (connected regular graphs).

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

Cf. A088741 (connected strongly regular graphs).

Sequence in context: A107083 A266694 A284928 * A160218 A208983 A337609

Adjacent sequences:  A294402 A294403 A294404 * A294406 A294407 A294408

KEYWORD

nonn,more

AUTHOR

Eric W. Weisstein, Oct 30 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 10 06:08 EDT 2022. Contains 356029 sequences. (Running on oeis4.)