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.

A303271 Number of ordered rooted trees with n non-root nodes such that the maximal outdegree equals three.

Original entry on oeis.org

1, 4, 15, 53, 182, 616, 2070, 6930, 23166, 77429, 258973, 867230, 2908633, 9772556, 32896088, 110949072, 374934201, 1269505482, 4306750577, 14638006449, 49843505965, 170021694271, 580954640775, 1988357053020, 6816047416230, 23400699072231, 80455436055699
Offset: 3

Views

Author

Alois P. Heinz, Apr 20 2018

Keywords

Crossrefs

Column k=3 of A203717.

Programs

  • Maple
    b:= proc(u, o, k) option remember; `if`(u+o=0, 1,
          add(b(u-j, o+j-1, k), j=1..min(1, u))+
          add(b(u+j-1, o-j, k), j=1..min(k, o)))
        end:
    a:= n-> b(0, n, 3)-b(0, n, 2):
    seq(a(n), n=3..35);

Formula

a(n) = A036765(n) - A001006(n).