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.

A347967 Number of maximum matchings in the rooted tree with Matula-Goebel number n.

Original entry on oeis.org

1, 1, 2, 2, 1, 1, 3, 3, 3, 3, 3, 2, 2, 2, 1, 4, 2, 1, 4, 5, 5, 1, 1, 3, 4, 1, 4, 4, 5, 3, 1, 5, 4, 5, 2, 2, 3, 3, 3, 7, 1, 2, 4, 2, 1, 4, 3, 4, 8, 8, 2, 2, 5, 1, 1, 6, 7, 3, 5, 5, 2, 4, 7, 6, 1, 1, 3, 8, 1, 6, 7, 3, 2, 2, 4, 6, 7, 1, 2, 9, 5, 3, 4, 4, 7, 2, 8
Offset: 1

Views

Author

Kevin Ryde, Sep 22 2021

Keywords

Crossrefs

Cf. A206483 (matching number), A202853 (matchings by size), A347966 (maximal matchings), A193404 (all matchings).

Programs

  • PARI
    \\ See links.

Formula

a(n) = A202853(n, A206483(n)), being the end-most term of row n of A202853.