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.

A339444 Number of partitions of n into triangular numbers such that the number of parts is a triangular number.

Original entry on oeis.org

1, 1, 0, 2, 0, 1, 2, 1, 2, 1, 4, 1, 4, 2, 3, 6, 4, 6, 4, 7, 6, 10, 8, 8, 11, 11, 14, 11, 17, 14, 22, 19, 18, 24, 24, 30, 27, 33, 31, 38, 42, 39, 47, 49, 54, 59, 60, 63, 72, 77, 79, 85, 95, 94, 104, 116, 115, 131, 133, 142, 154, 165, 168, 180, 200, 203
Offset: 0

Views

Author

Ilya Gutkovskiy, Dec 05 2020

Keywords

Examples

			                          [1]
                          [1 1]      [1]
                          [1 1 1]    [1 1]    [1]
a(10) = 4 because we have [1 1 1 1], [1 3 3], [3 6] and [10].
		

Crossrefs