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.

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

This page as a plain text file.
%I A245128 #8 Jul 12 2014 09:40:02
%S A245128 6,32,140,490,1582,4679,13207,35579,92848,235364,583368,1417164,
%T A245128 3386221,7972754,18536344,42613503,97001737,218855237,489889224,
%U A245128 1088756521,2404139499,5277595013,11523611147,25038756870,54160808489,116670213947,250366691420,535375247787
%N A245128 Number of n-node rooted identity trees with thinning limbs and root outdegree (branching factor) 9.
%H A245128 Alois P. Heinz, <a href="/A245128/b245128.txt">Table of n, a(n) for n = 37..500</a>
%p A245128 b:= proc(n, i, h, v) option remember; `if`(n=0, `if`(v=0, 1, 0),
%p A245128       `if`(i<1 or v<1 or n<v, 0, add(binomial(A(i, min(i-1, h)), j)
%p A245128        *b(n-i*j, i-1, h, v-j), j=0..min(n/i, v))))
%p A245128     end:
%p A245128 A:= proc(n, k) option remember;
%p A245128       `if`(n<2, n, add(b(n-1$2, j$2), j=1..min(k, n-1)))
%p A245128     end:
%p A245128 a:= n-> b(n-1$2, 9$2):
%p A245128 seq(a(n), n=37..70);
%Y A245128 Column k=9 of A245120.
%K A245128 nonn
%O A245128 37,1
%A A245128 _Alois P. Heinz_, Jul 12 2014