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.
%I A318819 #4 Sep 04 2018 11:42:01 %S A318819 0,1,1,3,8,23,61,167,461,1288,3593,10084,28381,80218,227156,644864, %T A318819 1834290,5227297,14919502,42644478,122047963,349716506,1003120145, %U A318819 2880163515,8276937322,23805829084,68521035251,197365718477,568859465838,1640609651599,4734261078026 %N A318819 Number of rooted trees with n nodes such that four equals the maximal number of subtrees of the same size extending from the same node. %H A318819 Alois P. Heinz, <a href="/A318819/b318819.txt">Table of n, a(n) for n = 4..2143</a> %p A318819 g:= proc(n, i, k) option remember; `if`(n=0, 1, `if`(i<1, 0, add( %p A318819 binomial(g(i-1$2, k)+j-1, j)*g(n-i*j, i-1, k), j=0..min(k, n/i)))) %p A318819 end: %p A318819 a:= n-> (k-> g(n-1$2, k) -g(n-1$2, k-1))(4): %p A318819 seq(a(n), n=4..34); %Y A318819 Column k=4 of A318754. %K A318819 nonn %O A318819 4,4 %A A318819 _Alois P. Heinz_, Sep 04 2018