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.

A364793 Number of partitions of n with at most four part sizes.

Original entry on oeis.org

1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 42, 56, 77, 101, 135, 175, 229, 292, 375, 470, 591, 733, 905, 1103, 1343, 1615, 1938, 2309, 2726, 3211, 3758, 4379, 5069, 5865, 6716, 7694, 8769, 9967, 11254, 12732, 14264, 16025, 17877, 19959, 22149, 24605, 27147, 30012, 33006, 36294, 39742, 43573, 47524
Offset: 0

Views

Author

Seiichi Manyama, Sep 14 2023

Keywords

Crossrefs

Programs

  • Python
    from sympy.utilities.iterables import partitions
    def A364793(n): return sum(1 for p in partitions(n) if len(p)<=4) # Chai Wah Wu, Sep 14 2023

Formula

a(n) = Sum_{k=1..4} A116608(n,k).