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.

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

Original entry on oeis.org

2, 60, 9692375
Offset: 1

Views

Author

Ilya Gutkovskiy, Jun 30 2024

Keywords

Comments

There are no further positive terms <= 10^15. - Michael S. Branicky, Jul 01 2024

Examples

			a(2) = 60 = 5 + 55 = 30 + 30.
		

Crossrefs

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

Original entry on oeis.org

2, 1471, 269406
Offset: 1

Views

Author

Ilya Gutkovskiy, Jun 30 2024

Keywords

Comments

There are no further positive terms <= 10^15. - Michael S. Branicky, Jul 01 2024

Examples

			a(2) = 1471 = 1 + 1470 = 288 + 1183.
		

Crossrefs

Showing 1-2 of 2 results.