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.

A292216 Number of (unlabeled) rooted trees with n leaf nodes and without unary nodes or outdegrees larger than ten.

This page as a plain text file.
%I A292216 #5 Sep 11 2017 19:50:23
%S A292216 0,1,1,2,5,12,33,90,261,766,2312,7067,21962,68944,218718,699423,
%T A292216 2253303,7304522,23812437,78008885,256688310,847979474,2811399583,
%U A292216 9351303948,31196953900,104359901859,349979094150,1176395410202,3962715659611,13375015304266
%N A292216 Number of (unlabeled) rooted trees with n leaf nodes and without unary nodes or outdegrees larger than ten.
%H A292216 Alois P. Heinz, <a href="/A292216/b292216.txt">Table of n, a(n) for n = 0..1000</a>
%H A292216 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%p A292216 b:= proc(n, i, v) option remember; `if`(n=0,
%p A292216       `if`(v=0, 1, 0), `if`(i<1 or v<1 or n<v, 0,
%p A292216       `if`(v=n, 1, add(binomial(a(i)+j-1, j)*
%p A292216        b(n-i*j, i-1, v-j), j=0..min(n/i, v)))))
%p A292216     end:
%p A292216 a:= proc(n) option remember; `if`(n<2, n,
%p A292216       add(b(n, n+1-j, j), j=2..min(n, 10)))
%p A292216     end:
%p A292216 seq(a(n), n=0..35);
%Y A292216 Column k=10 of A292085.
%K A292216 nonn
%O A292216 0,4
%A A292216 _Alois P. Heinz_, Sep 11 2017