cp's OEIS Frontend

A291825 Number of ordered rooted trees with n non-root nodes and all outdegrees <= ten.

%I A291825 #26 May 03 2019 21:23:41
%S A291825 1,1,2,5,14,42,132,429,1430,4862,16796,58785,207999,742795,2673760,
%T A291825 9690969,35337321,129543843,477158000,1765043115,6554105415,
%U A291825 24421914855,91289026931,342225162126,1286341683924,4846861938006,18303921153521,69268371485362,262644901975126
%N A291825 Number of ordered rooted trees with n non-root nodes and all outdegrees <= ten.
%C A291825 Also the number of Dyck paths of semilength n with all ascent lengths <= ten.
%C A291825 Also the number of permutations p of [n] such that in 0p all up-jumps are <= ten and no down-jump is larger than 1. An up-jump j occurs at position i in p if p_{i} > p_{i-1} and j is the index of p_i in the increasingly sorted list of those elements in {p_{i}, ..., p_{n}} that are larger than p_{i-1}. A down-jump j occurs at position i in p if p_{i} < p_{i-1} and j is the index of p_i in the decreasingly sorted list of those elements in {p_{i}, ..., p_{n}} that are smaller than p_{i-1}. First index in the lists is 1 here.
%C A291825 Differs from A000108 first at n = 11.
%H A291825 Alois P. Heinz, <a href="/A291825/b291825.txt">Table of n, a(n) for n = 0..1000</a>
%H A291825 N. Hein and J. Huang, <a href="http://arxiv.org/abs/1508.01688">Modular Catalan Numbers</a>, arXiv:1508.01688 [math.CO], 2015
%H A291825 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%F A291825 G.f.: G(x)/x where G(x) is the reversion of x*(1-x)/(1-x^11). - _Andrew Howroyd_, Dec 01 2017
%F A291825 G.f. A(x) satisfies: A(x) = 1 + Sum_{k=1..10} x^k*A(x)^k. - _Ilya Gutkovskiy_, May 03 2019
%p A291825 b:= proc(u, o) option remember; `if`(u+o=0, 1,
%p A291825       add(b(u-j, o+j-1), j=1..min(1, u))+
%p A291825       add(b(u+j-1, o-j), j=1..min(10, o)))
%p A291825     end:
%p A291825 a:= n-> b(0, n):
%p A291825 seq(a(n), n=0..30);
%t A291825 b[u_, o_, k_] := b[u, o, k] = If[u + o == 0, 1, Sum[b[u - j, o + j - 1, k], {j, 1, Min[1, u]}] + Sum[b[u + j - 1, o - j, k], {j, 1, Min[k, o]}]];
%t A291825 a[n_] := b[0, n, 10];
%t A291825 Table[a[n], {n, 0, 30}] (* _Jean-François Alcover_, Nov 07 2017, after _Alois P. Heinz_ *)
%o A291825 (PARI) Vec(serreverse(x*(1-x)/(1-x*x^10) + O(x*x^25))) \\ _Andrew Howroyd_, Nov 29 2017
%Y A291825 Column k=10 of A288942.
%Y A291825 Cf. A000108.
%K A291825 nonn
%O A291825 0,3
%A A291825 _Alois P. Heinz_, Sep 01 2017