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.

A245129 Number of n-node rooted identity trees with thinning limbs and root outdegree (branching factor) 10.

This page as a plain text file.
%I A245129 #8 Jul 12 2014 10:10:51
%S A245129 4,38,176,709,2461,7877,23564,67260,184289,489321,1264330,3194192,
%T A245129 7913035,19276841,46269287,109625994,256748635,595150930,1366840825,
%U A245129 3112999517,7036328521,15794921314,35233087579,78140317345,172382151706,378427107050,826999312010
%N A245129 Number of n-node rooted identity trees with thinning limbs and root outdegree (branching factor) 10.
%H A245129 Alois P. Heinz, <a href="/A245129/b245129.txt">Table of n, a(n) for n = 43..500</a>
%p A245129 b:= proc(n, i, h, v) option remember; `if`(n=0, `if`(v=0, 1, 0),
%p A245129       `if`(i<1 or v<1 or n<v, 0, add(binomial(A(i, min(i-1, h)), j)
%p A245129        *b(n-i*j, i-1, h, v-j), j=0..min(n/i, v))))
%p A245129     end:
%p A245129 A:= proc(n, k) option remember;
%p A245129       `if`(n<2, n, add(b(n-1$2, j$2), j=1..min(k, n-1)))
%p A245129     end:
%p A245129 a:= n-> b(n-1$2, 10$2):
%p A245129 seq(a(n), n=43..75);
%Y A245129 Column k=10 of A245120.
%K A245129 nonn
%O A245129 43,1
%A A245129 _Alois P. Heinz_, Jul 12 2014