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.

Showing 1-7 of 7 results.

A341021 Number of partitions of n into 4 distinct nonzero triangular numbers.

Original entry on oeis.org

1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 2, 0, 2, 0, 1, 1, 0, 2, 1, 3, 0, 1, 2, 0, 2, 2, 1, 3, 2, 0, 2, 2, 2, 1, 3, 0, 4, 3, 1, 3, 2, 2, 3, 2, 1, 5, 3, 3, 2, 4, 1, 2, 5, 1, 5, 3, 2, 5, 3, 3, 4, 4, 3, 4, 6, 0, 6, 4, 2, 7, 4, 3, 5, 4, 3, 5, 5, 5, 4, 5, 5, 5, 8, 2, 6, 5, 1, 10, 5, 4, 7, 7, 4
Offset: 20

Views

Author

Ilya Gutkovskiy, Feb 02 2021

Keywords

Crossrefs

A341022 Number of partitions of n into 5 distinct nonzero triangular numbers.

Original entry on oeis.org

1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 2, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 2, 1, 1, 3, 0, 2, 2, 0, 1, 3, 2, 3, 2, 1, 2, 3, 2, 0, 5, 1, 3, 3, 2, 3, 2, 4, 2, 5, 2, 2, 6, 1, 4, 6, 1, 5, 6, 3, 4, 4, 4, 4, 5, 3, 5, 7, 6, 4, 8, 2, 5, 7, 3, 7, 7, 7, 5, 7, 6, 4, 12, 5, 4, 10, 3, 11, 9, 5, 9, 8, 5
Offset: 35

Views

Author

Ilya Gutkovskiy, Feb 02 2021

Keywords

Crossrefs

A341023 Number of partitions of n into 6 distinct nonzero triangular numbers.

Original entry on oeis.org

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

Views

Author

Ilya Gutkovskiy, Feb 02 2021

Keywords

Crossrefs

A341024 Number of partitions of n into 7 distinct nonzero triangular numbers.

Original entry on oeis.org

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

Views

Author

Ilya Gutkovskiy, Feb 02 2021

Keywords

Crossrefs

A341025 Number of partitions of n into 8 distinct nonzero triangular numbers.

Original entry on oeis.org

1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 2, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 2, 1, 1, 2, 0, 1, 0, 2, 1, 2, 1, 0, 3, 1, 1, 3, 1, 1, 2, 1, 2, 4, 2, 2, 2, 0, 2, 5, 2, 1, 5, 2, 2, 4, 3, 4, 2, 3, 4, 3, 5, 1, 8, 4, 3, 8, 1, 4, 7, 2, 5, 7, 5, 6, 6, 4, 4, 10, 6
Offset: 120

Views

Author

Ilya Gutkovskiy, Feb 02 2021

Keywords

Crossrefs

A341026 Number of partitions of n into 9 distinct nonzero triangular numbers.

Original entry on oeis.org

1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 2, 0, 1, 0, 0, 2, 1, 0, 1, 1, 1, 1, 2, 0, 1, 2, 1, 2, 0, 0, 3, 1, 0, 4, 1, 2, 1, 1, 1, 2, 3, 1, 2, 3, 0, 4, 3, 2, 3, 2, 2, 1, 4, 1, 6, 3, 1, 5, 2, 2, 7, 4, 2, 3, 4, 5, 5, 5, 4, 4, 6
Offset: 165

Views

Author

Ilya Gutkovskiy, Feb 02 2021

Keywords

Crossrefs

A350288 a(n) is the smallest number which can be represented as the sum of n distinct nonzero triangular numbers in exactly n ways, or 0 if no such number exists.

Original entry on oeis.org

1, 16, 37, 64, 83, 128, 177, 204, 270, 352, 430, 533, 632, 764, 893, 1102, 1256, 1443, 1630, 1855, 2141, 2384, 2699, 3053, 3378, 3753, 4176, 4620, 5068, 5570, 6107, 6654, 7253, 7904, 8526, 9241, 9975, 10699, 11533, 12401, 13301, 14189, 15179, 16233, 17286, 18412
Offset: 1

Views

Author

Ilya Gutkovskiy, Dec 23 2021

Keywords

Examples

			For n = 2: 16 = 1 + 15 = 6 + 10.
For n = 3: 37 = 1 + 15 + 21 = 3 + 6 + 28 = 6 + 10 + 21.
		

Crossrefs

Extensions

More terms from Jinyuan Wang, Dec 26 2021
Showing 1-7 of 7 results.