cp's OEIS Frontend

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.

A318804 Number of rooted trees with n nodes such that no more than ten subtrees of the same size extend from the same node.

This page as a plain text file.
%I A318804 #7 Sep 04 2018 17:03:30
%S A318804 0,1,1,2,4,9,20,48,115,286,719,1842,4765,12484,32968,87798,235346,
%T A318804 634752,1720897,4687949,12824195,35216118,97039045,268237121,
%U A318804 743594937,2066803841,5758576675,16080698759,44998355630,126161517745,354354779794,996963790045,2809334906744,7928088014833,22404525682610
%N A318804 Number of rooted trees with n nodes such that no more than ten subtrees of the same size extend from the same node.
%C A318804 This differs from A318857 first at n=34.
%H A318804 Alois P. Heinz, <a href="/A318804/b318804.txt">Table of n, a(n) for n = 0..2136</a>
%p A318804 g:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0, add(
%p A318804       binomial(g((i-1)$2)+j-1, j)*g(n-i*j, i-1), j=0..min(10, n/i))))
%p A318804     end:
%p A318804 a:= n-> g((n-1)$2):
%p A318804 seq(a(n), n=0..40);
%Y A318804 Column k=10 of A318753.
%Y A318804 Cf. A318857.
%K A318804 nonn
%O A318804 0,4
%A A318804 _Alois P. Heinz_, Sep 03 2018