login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Unrooted unlabeled connected Ptolemaic graphs on n nodes.
0

%I #12 Jul 25 2019 04:36:17

%S 1,1,2,5,14,47,170,676,2834,12471,56675,264906,1264851,6150187,

%T 30357300,151798497,767573729,3919462385

%N Unrooted unlabeled connected Ptolemaic graphs on n nodes.

%H Maryam Bahrani and Jérémie Lumbroso, <a href="http://arxiv.org/abs/1608.01465">Enumerations, Forbidden Subgraph Characterizations, and the Split-Decomposition</a>, arXiv:1608.01465 [math.CO], 2016.

%K nonn,more

%O 1,3

%A _N. J. A. Sloane_, Jun 21 2017

%E Definition corrected (connected only) by _Falk Hüffner_, Jul 24 2019