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”).
%I #8 Sep 11 2017 02:33:07
%S 1,3,7,11,19,27,35,47,61,77,95,111,135,159,185,215,243,275,311,343,
%T 383,427
%N Minimal number of nodes of a tree requiring width n in any LR-drawing.
%H Fabrizio Frati, M. Patrignani, V. Roselli, <a href="https://arxiv.org/abs/1610.02841">LR-Drawings of Ordered Rooted Binary Trees and Near-Linear Area Drawings of Outerplanar Graphs</a>, arXiv preprint arXiv:1610.02841 [cs.CG], 2016.
%K nonn,more
%O 1,2
%A _N. J. A. Sloane_, Sep 10 2017