|
| |
|
|
A068590
|
|
Number of different Euler multigraphs with n edges, loops allowed.
|
|
1
|
|
|
|
1, 3, 6, 16, 34, 90, 213, 572, 1499, 4231, 12115, 36660, 114105
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
COMMENTS
|
Independent computation gives a(11)=12110 and thereafter different values (see Irvine link). Li is investigating as of March 2024. - Sean A. Irvine, May 16 2024
|
|
|
REFERENCES
|
Huaien Li and David C. Torney, Enumerations of Multigraphs, 2002.
|
|
|
LINKS
|
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,more
|
|
|
AUTHOR
|
Huaien Li and David C. Torney (huaien_li(AT)hotmail.com), Mar 27 2002
|
|
|
STATUS
|
approved
|
| |
|
|
