|
%I #7 May 17 2024 10:19:55
%S 1,3,6,16,34,90,213,572,1499,4231,12115,36660,114105
%N Number of different Euler multigraphs with n edges, loops allowed.
%C 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
%D Huaien Li and David C. Torney, Enumerations of Multigraphs, 2002.
%H Sean A. Irvine, <a href="/A068590/a068590.txt">Proposed values</a>
%K nonn,more,changed
%O 1,2
%A Huaien Li and David C. Torney (huaien_li(AT)hotmail.com), Mar 27 2002
|
