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 A292214 #5 Sep 11 2017 19:05:24 %S A292214 0,1,1,2,5,12,33,90,261,765,2309,7058,21932,68843,218378,698268, %T A292214 2249370,7291072,23766308,77850244,256141505,846090860,2804864997, %U A292214 9328658392,31118365152,104086821258,349029100890,1173087112579,3951183698640,13334782347941 %N A292214 Number of (unlabeled) rooted trees with n leaf nodes and without unary nodes or outdegrees larger than eight. %H A292214 Alois P. Heinz, <a href="/A292214/b292214.txt">Table of n, a(n) for n = 0..1000</a> %H A292214 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a> %p A292214 b:= proc(n, i, v) option remember; `if`(n=0, %p A292214 `if`(v=0, 1, 0), `if`(i<1 or v<1 or n<v, 0, %p A292214 `if`(v=n, 1, add(binomial(a(i)+j-1, j)* %p A292214 b(n-i*j, i-1, v-j), j=0..min(n/i, v))))) %p A292214 end: %p A292214 a:= proc(n) option remember; `if`(n<2, n, %p A292214 add(b(n, n+1-j, j), j=2..min(n, 8))) %p A292214 end: %p A292214 seq(a(n), n=0..35); %Y A292214 Column k=8 of A292085. %K A292214 nonn %O A292214 0,4 %A A292214 _Alois P. Heinz_, Sep 11 2017