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 A318803 #4 Sep 03 2018 22:29:01 %S A318803 0,1,1,2,4,9,20,48,115,286,719,1841,4764,12481,32960,87776,235286, %T A318803 634585,1720432,4686643,12820514,35205695,97009447,268152808, %U A318803 743354184,2066114828,5756601016,16075023964,44982030666,126114489722,354219135234,996572101250 %N A318803 Number of rooted trees with n nodes such that no more than nine subtrees of the same size extend from the same node. %H A318803 Alois P. Heinz, <a href="/A318803/b318803.txt">Table of n, a(n) for n = 0..2136</a> %p A318803 g:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0, add( %p A318803 binomial(g((i-1)$2)+j-1, j)*g(n-i*j, i-1), j=0..min(9, n/i)))) %p A318803 end: %p A318803 a:= n-> g((n-1)$2): %p A318803 seq(a(n), n=0..40); %Y A318803 Column k=9 of A318753. %K A318803 nonn %O A318803 0,4 %A A318803 _Alois P. Heinz_, Sep 03 2018