login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A243561 Number of simple connected graphs with n nodes that are distance regular and have no subgraph isomorphic to diamond graph. 0
1, 1, 1, 1, 1, 2, 1, 3, 2, 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

CROSSREFS

Cf. A242790 (diamond free graphs), A241814 (distance regular graphs).

Sequence in context: A118010 A318730 A259974 * A135550 A035491 A318574

Adjacent sequences:  A243558 A243559 A243560 * A243562 A243563 A243564

KEYWORD

nonn,more

AUTHOR

Travis Hoppe and Anna Petrone, Jun 06 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 November 20 14:54 EST 2019. Contains 329337 sequences. (Running on oeis4.)