cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A281094 Maximum number of nonisomorphic subtrees of a tree of order n.

This page as a plain text file.
%I A281094 #36 Mar 11 2018 13:18:12
%S A281094 1,2,3,4,6,8,11,16,23,33,47,68,105,160,245,366,545,816,1212
%N A281094 Maximum number of nonisomorphic subtrees of a tree of order n.
%H A281094 Éva Czabarka, László A. Székely and Stephan Wagner, <a href="https://arxiv.org/abs/1601.00944">On the number of nonisomorphic subtrees of a tree</a>, arXiv:1601.00944 [math.CO], 2016.
%H A281094 Manfred Scheucher, <a href="/A281094/a281094_1.sage.txt">Sage script (dynamic programming)</a>
%e A281094 For n=5, the path and the star both have five nonisomorphic subtrees (paths resp. stars of all orders from 1 to 5). The third possible tree of order 5 has six nonisomorphic subtrees (one each of order 1,2,3,5 and two of order 4: the star and the path). Hence a(5)=6.
%Y A281094 Cf. A281578.
%K A281094 nonn,nice,more
%O A281094 1,2
%A A281094 _Stephan Wagner_, Jan 24 2017
%E A281094 a(16)-a(19) from _Manfred Scheucher_, Mar 10 2018