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.

A318857 Number of rooted trees with n nodes such that no more than ten isomorphic subtrees extend from the same node.

Original entry on oeis.org

0, 1, 1, 2, 4, 9, 20, 48, 115, 286, 719, 1842, 4765, 12484, 32968, 87798, 235346, 634752, 1720897, 4687949, 12824195, 35216118, 97039045, 268237121, 743594937, 2066803841, 5758576675, 16080698759, 44998355630, 126161517745, 354354779794, 996963790045, 2809334906744, 7928088014833, 22404525682620
Offset: 0

Views

Author

Alois P. Heinz, Sep 04 2018

Keywords

Comments

This differs from A318804 first at n=34.

Crossrefs

Column k=10 of A318757.
Cf. A318804.

Programs

  • Maple
    h:= proc(n, m, t) option remember; `if`(m=0, binomial(n+t, t),
          `if`(n=0, 0, add(h(n-1, m-j, t+1), j=1..min(10, m))))
        end:
    b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,
          add(b(n-i*j, i-1)*h(a(i), j, 0), j=0..n/i)))
        end:
    a:= n-> `if`(n<2, n, b(n-1$2)):
    seq(a(n), n=0..35);