0,3

F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 218.

R. C. Read (rcread(AT)math.uwaterloo.ca), email to njas, 28 August, 2000.

R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.

R. W. Robinson, Counting strong digraphs (research announcement), J. Graph Theory 1, 1977, pp. 189-190.

Cf. A057270, A003029 (labeled case), A003085, A035512, A051421, A049531, A049512.

Adjacent sequences: A003085 A003086 A003087 this_sequence A003089 A003090 A003091

Sequence in context: A013050 A051255 A120445 this_sequence A121231 A122527 A039747

nonn,nice,more

njas

Note that Read and Wilson incorrectly give a(4) as 172 - thanks to Vladeta Jovovic, Goran Kilibarda (vladeta(AT)Eunet.yu) for finding this error, and for verifying a(5).