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

 


A357070
Number of partitions of n into at most 2 distinct positive triangular numbers.
2
1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 2, 0, 1, 0, 0, 2, 1, 0, 1, 1, 0, 1, 1, 1, 0, 2, 0, 0, 1, 0, 2, 1, 1, 1, 0, 0, 1, 1, 0, 1, 2, 0, 1, 1, 0, 2, 0, 0, 0, 2, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 2, 1, 0, 1, 1, 0, 1, 1, 0, 0, 2, 0, 1, 1, 0, 3, 0, 1, 1, 0, 0, 1, 1, 0, 0, 2, 1, 1, 2, 0, 0, 1, 0, 1, 1, 1
OFFSET
0,17
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Oct 25 2022
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 21 13:55 EDT 2024. Contains 376087 sequences. (Running on oeis4.)