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.

A318819 Number of rooted trees with n nodes such that four equals the maximal number of subtrees of the same size extending from the same node.

Original entry on oeis.org

0, 1, 1, 3, 8, 23, 61, 167, 461, 1288, 3593, 10084, 28381, 80218, 227156, 644864, 1834290, 5227297, 14919502, 42644478, 122047963, 349716506, 1003120145, 2880163515, 8276937322, 23805829084, 68521035251, 197365718477, 568859465838, 1640609651599, 4734261078026
Offset: 4

Views

Author

Alois P. Heinz, Sep 04 2018

Keywords

Crossrefs

Column k=4 of A318754.

Programs

  • Maple
    g:= proc(n, i, k) option remember; `if`(n=0, 1, `if`(i<1, 0, add(
          binomial(g(i-1$2, k)+j-1, j)*g(n-i*j, i-1, k), j=0..min(k, n/i))))
        end:
    a:= n-> (k-> g(n-1$2, k) -g(n-1$2, k-1))(4):
    seq(a(n), n=4..34);