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 A244707 #5 Jul 08 2014 09:11:07 %S A244707 1,1,3,6,15,31,74,157,359,786,1766,3895,8710,19287,42987,95437,212468, %T A244707 472204,1050940,2337221,5201558,11573156,25759514,57332239,127633669, %U A244707 284148877,632704464,1408925270,3137861761,6989057709,15568767849,34684141315,77277619879 %N A244707 Number of n-node unlabeled rooted trees with thinning limbs and root outdegree (branching factor) 6. %C A244707 In a rooted tree with thinning limbs the outdegree of a parent node is larger than or equal to the outdegree of any of its child nodes. %H A244707 Alois P. Heinz, <a href="/A244707/b244707.txt">Table of n, a(n) for n = 7..900</a> %p A244707 b:= proc(n, i, h, v) option remember; `if`(n=0, %p A244707 `if`(v=0, 1, 0), `if`(i<1 or v<1 or n<v, 0, %p A244707 `if`(n=v, 1, add(binomial(A(i, min(i-1, h))+j-1, j) %p A244707 *b(n-i*j, i-1, h, v-j), j=0..min(n/i, v))))) %p A244707 end: %p A244707 A:= proc(n, k) option remember; %p A244707 `if`(n<2, n, add(b(n-1$2, j$2), j=1..min(k,n-1))) %p A244707 end: %p A244707 a:= n-> b(n-1$2, 6$2): %p A244707 seq(a(n), n=7..50); %Y A244707 Column k=6 of A244657. %K A244707 nonn %O A244707 7,3 %A A244707 _Alois P. Heinz_, Jul 04 2014