Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057560
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A057560 Weakly distance-regular digraphs on n nodes (excluding distance-regular graphs). +0
4
0, 0, 1, 2, 1, 6, 2, 12, 6, 5, 2, 34, 2, 9, 19, 44, 1, 46, 3, 31, 17 (list; graph; listen)
OFFSET

1,4

REFERENCES

Akihide Hanaki and Izumi Miyamoto, Classification of primitive association schemes of order up to 22, Kyushu J. Math., 54 (2000), 81-86.

LINKS

A. Hanaki and I. Miyamoto, Classification of association schemes with small vertices

Y. Suga, Association schemes with up to 15 vertices

CROSSREFS

Cf. A057495, A057498, A057499.

Sequence in context: A071883 A099304 A064680 this_sequence A085592 A089849 A006019

Adjacent sequences: A057557 A057558 A057559 this_sequence A057561 A057562 A057563

KEYWORD

nonn,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Oct 01 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research