A324263 Number of simple connected graphs on n unlabeled nodes with exactly two peripheral nodes.

0, 1, 1, 2, 5, 25, 185, 2459, 58156, 2617378

Offset

1,4

Comments

These are the graphs that only have two nodes whose distance from each other is equal to the diameter. An example of such a graph is the path graph.

Links

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

Crossrefs

Column 2 of A324244.

Sequence in context: A074417 A296105 A268120 * A049650 A191506 A139007

Adjacent sequences: A324260 A324261 A324262 * A324264 A324265 A324266

Keyword

nonn,more,changed

Author

Andrew Howroyd, Sep 02 2019

Status

approved