|
%I #8 Dec 12 2014 19:21:29
%S 1,2,4,10,25,80,277,1150,5291,26918,145744,828856,4872771,29395784,
%T 180857382,1130700488,7163245811,45895629266,296937363511,
%U 1937625709854,12739784808937,84331837321404,561647630439975,3761221057579892
%N Number of outerplanar graphs on n unlabeled nodes.
%H M. Bordirsky, É. Fusy, M. Kang and S. Vigerske, <a href="http://www.arXiv.org/abs/math.CO/0511422">Enumeration of Unlabeled Outerplanar Graphs</a>, 2005
%H S. Vigerske, <a href="http://www.informatik.hu-berlin.de/Forschung_Lehre/algorithmen/en/forschung/planar/vigerske.html">Asymptotic enumeration of unlabeled outerplanar graphs, Diploma thesis</a>, Humboldt University Berlin, 2005
%H S. Vigerske, <a href="http://www.math.hu-berlin.de/~stefan">Homepage</a>
%F Generating function and cycle index sum known, see Vigerske, or Bodirsky, Fusy, Kang and Vigerske.
%Y Cf. A001004, A097999, A097998, A098000.
%K nonn
%O 1,2
%A Stefan Vigerske, Nov 17 2005
|
