|
%I #8 Nov 16 2015 00:48:26
%S 0,0,1,2,1,6,2,12,6,5,2,34,2,9,19,44,1,46,3,31,17
%N Weakly distance-regular digraphs on n nodes (excluding distance-regular graphs).
%H A. Hanaki and I. Miyamoto, <a href="http://math.shinshu-u.ac.jp/~hanaki/as/">Classification of association schemes with small vertices</a>
%H Akihide Hanaki and Izumi Miyamoto, <a href="http://doi.org/10.2206/kyushujm.54.81">Classification of primitive association schemes of order up to 22</a>, Kyushu J. Math., 54 (2000), 81-86.
%H Y. Suga, <a href="http://www.math.kyushu-u.ac.jp/stat/Suga/ass/class.htm">Association schemes with up to 15 vertices</a> [Broken link]
%Y Cf. A057495, A057498, A057499.
%K nonn,nice,more
%O 1,4
%A _N. J. A. Sloane_, Oct 01 2000
|
