|
%I #15 Nov 13 2022 09:32:33
%S 3,9,43,217,1328,19700
%N Number of assembly graphs with n rigid vertices and no crossings.
%C See Burns et al. links for precise definition.
%H Jonathan Burns, <a href="http://shell.cas.usf.edu/~saito/DNAweb/SimpleAssemblyTable.txt">Assembly Graph Words - Single Transverse Component (Counts)</a>.
%H Jonathan Burns, Egor Dolzhenko, Natasa Jonoska, Tilahun Muche, and Masahico Saito, <a href="https://doi.org/10.1016/j.dam.2013.01.003">Four-Regular Graphs with Rigid Vertices Associated to DNA Recombination</a>, Discrete Applied Mathematics, Volume 161, Issues 10-11, July 2013, Pages 1378-1394.
%K nonn,more
%O 2,1
%A _N. J. A. Sloane_, Nov 03 2011
|
