login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A364793 Number of partitions of n with at most four part sizes. 2
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = Sum_{k=1..4} A116608(n,k).
PROG
(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
CROSSREFS
Sequence in context: A341714 A332746 A242698 * A330641 A242699 A194439
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Sep 14 2023
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 10 10:26 EDT 2024. Contains 374207 sequences. (Running on oeis4.)