login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
A319896
Number of connected non-regular multigraphs with n nodes of degree up to n.
1
0, 1, 0, 3, 31, 595, 33931, 6020479, 3613415171
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
0,4
COMMENTS
Multigraphs are loopless.
Terms computed using nauty traces.
LINKS
Table of n, a(n) for n=0..8.
Brendan McKay and Adolfo Piperno,
Nauty traces
FORMULA
a(n) =
A289988
(n) -
A319897
(n).
CROSSREFS
Cf.
A289988
,
A289986
,
A319897
.
Sequence in context:
A273378
A266487
A229258
*
A370260
A222895
A105293
Adjacent sequences:
A319893
A319894
A319895
*
A319897
A319898
A319899
KEYWORD
nonn
,
more
,
hard
AUTHOR
Natan Arie Consigli
, Sep 30 2018
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 April 24 07:17 EDT 2024. Contains 371920 sequences. (Running on oeis4.)