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”).

A292095
Minimal number of nodes of a tree requiring width n in any LR-drawing.
0
1, 3, 7, 11, 19, 27, 35, 47, 61, 77, 95, 111, 135, 159, 185, 215, 243, 275, 311, 343, 383, 427
OFFSET
1,2
LINKS
Fabrizio Frati, M. Patrignani, V. Roselli, LR-Drawings of Ordered Rooted Binary Trees and Near-Linear Area Drawings of Outerplanar Graphs, arXiv preprint arXiv:1610.02841 [cs.CG], 2016.
CROSSREFS
Sequence in context: A049754 A191114 A181497 * A265323 A346912 A276456
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Sep 10 2017
STATUS
approved