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 A318801 #4 Sep 03 2018 22:00:17 %S A318801 0,1,1,2,4,9,20,48,115,285,717,1837,4753,12451,32878,87549,234654, %T A318801 632813,1715444,4672539,12780498,35091807,96684475,267223388, %U A318801 740690724,2058468449,5734614700,16011714519,44799497408,125587597723,352696619768,992168346445 %N A318801 Number of rooted trees with n nodes such that no more than seven subtrees of the same size extend from the same node. %H A318801 Alois P. Heinz, <a href="/A318801/b318801.txt">Table of n, a(n) for n = 0..2136</a> %p A318801 g:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0, add( %p A318801 binomial(g((i-1)$2)+j-1, j)*g(n-i*j, i-1), j=0..min(7, n/i)))) %p A318801 end: %p A318801 a:= n-> g((n-1)$2): %p A318801 seq(a(n), n=0..40); %Y A318801 Column k=7 of A318753. %K A318801 nonn %O A318801 0,4 %A A318801 _Alois P. Heinz_, Sep 03 2018