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.

A032028 Number of rooted planar trees (n+1 nodes) where any 2 subtrees extending from same node are different.

Original entry on oeis.org

1, 1, 1, 2, 4, 9, 23, 62, 167, 461, 1309, 3784, 11018, 32431, 96294, 288246, 868107, 2629499, 8005166, 24482202, 75177313, 231697259, 716488213, 2222381516, 6912569477, 21556270329, 67380727837, 211080434346
Offset: 1

Views

Author

Keywords

Programs

  • PARI
    AGK(v)={apply(p->subst(serlaplace(y^0*p),y,1), Vec(prod(k=1, #v, (1 + x^k*y + O(x*x^#v))^v[k])-1, -#v))}
    CGK(v)={apply(p->subst(serlaplace(p/y),y,1), Vec(prod(k=1, #v, (1 + x^k*y + O(x*x^#v))^v[k])-1, -#v))}
    seq(n)={my(v=[1]); for(i=3, n, v=concat([1], AGK(v))); concat([1], CGK(v))} \\ Andrew Howroyd, Sep 20 2018

Formula

"CGK" (necklace, elements, unlabeled) transform of A032027 (shifted right one place).