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.

A245053 Number of hybrid 10-ary trees with n internal nodes.

Original entry on oeis.org

1, 2, 39, 1103, 36650, 1333156, 51392991, 2062946770, 85311756697, 3609589528430, 155513170273468, 6799151325525095, 300899538364069838, 13453346159391591392, 606776046327452415295, 27573839101542183831805, 1261298294289947726165466, 58029238642196850552991302
Offset: 0

Views

Author

Alois P. Heinz, Jul 10 2014

Keywords

Crossrefs

Column k=10 of A245049.

Programs

  • Maple
    a:= n-> add(binomial(9*n+i, i)*binomial(9*n+i+1, n-i), i=0..n)/(9*n+1):
    seq(a(n), n=0..20);

Formula

a(n) = 1/(9*n+1) * Sum_{i=0..n} C(9*n+i,i)*C(9*n+i+1,n-i).
a(n) = [x^n] ((1+x)/(1-x-x^2))^(9*n+1) / (9*n+1).
G.f. satisfies: A(x) = (1+x*A(x)^9) * (1+x*A(x)^10).