login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A243334 Number of simple connected graphs with n nodes that are distance regular and triangle-free. 0
1, 1, 0, 1, 1, 2, 1, 3, 1, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

LINKS

Table of n, a(n) for n=1..10.

Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs

T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644, 2014

CROSSREFS

Cf. A241814 (distance regular graphs), A024607 (triangle-free graphs).

Sequence in context: A324287 A213594 A325252 * A234809 A135591 A114897

Adjacent sequences:  A243331 A243332 A243333 * A243335 A243336 A243337

KEYWORD

nonn,more

AUTHOR

Travis Hoppe and Anna Petrone, Jun 03 2014

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 23 07:07 EST 2020. Contains 331168 sequences. (Running on oeis4.)