login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A243322 Number of simple connected graphs with n nodes that are distance regular and Eulerian. 0
1, 0, 1, 1, 2, 2, 2, 3, 4, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
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), A003049 (Eulerian graphs).
Sequence in context: A156197 A155162 A275444 * A071454 A178139 A039642
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 02:22 EDT 2024. Contains 371767 sequences. (Running on oeis4.)