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 A244536 #8 Jul 02 2014 11:42:16 %S A244536 1,0,0,0,0,0,0,7,15,16,17,18,19,20,91,253,529,852,1225,1651,2133,3493, %T A244536 6931,14095,27156,47648,77297,118031,182462,300441,527398,954712, %U A244536 1722370,3015910,5074611,8342271,13730760,23036563,39558564,68974240,120541276 %N A244536 Number of ordered unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 7. %H A244536 Alois P. Heinz, <a href="/A244536/b244536.txt">Table of n, a(n) for n = 8..1000</a> %p A244536 b:= proc(n, t, k) option remember; `if`(n=0, %p A244536 `if`(t in [0, k], 1, 0), `if`(t>n, 0, add(b(j-1, k$2)* %p A244536 b(n-j, max(0, t-1), k), j=1..n))) %p A244536 end: %p A244536 a:= n-> b(n-1, 7$2) -b(n-1, 8$2): %p A244536 seq(a(n), n=8..50); %Y A244536 Column k=7 of A244530. %Y A244536 Cf. A244461. %K A244536 nonn %O A244536 8,8 %A A244536 _Joerg Arndt_ and _Alois P. Heinz_, Jun 29 2014