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-2 of 2 results.

A359321 a(n) is the smallest n-gonal pyramidal number which can be represented as the sum of n distinct nonzero n-gonal pyramidal numbers in exactly n ways, or -1 if none exists.

Original entry on oeis.org

2300, 6201, 8125, 6391
Offset: 3

Views

Author

Ilya Gutkovskiy, Dec 25 2022

Keywords

Examples

			For n = 3: 2300 = 1 + 969 + 1330 = 56 + 220 + 2024 = 165 + 364 + 1771.
For n = 4: 6201 = 1 + 91 + 1785 + 4324 = 1 + 285 + 1015 + 4900 = 30 + 140 + 506 + 5525 = 91 + 819 + 1496 + 3795.

Links

Crossrefs

Cf. A080851, A350210, A350397, A350423.

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

Original entry on oeis.org

28, 121, 210
Offset: 3

Views

Author

Ilya Gutkovskiy, May 23 2023

Keywords

Comments

a(8) = 736, a(9) = 969.

Examples

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

Links

Crossrefs

Cf. A057145, A350207, A350405, A350423.
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.