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.

Links

Crossrefs

Cf. A000330, A011541, A016032, A334013, A374193, A374194.

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

Original entry on oeis.org

2, 5972, 5170425
Offset: 1

Views

Author

Ilya Gutkovskiy, Jun 30 2024

Keywords

Comments

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

Examples

			a(2) = 5972 = 1222 + 4750 = 1925 + 4047.

Links

Crossrefs

Cf. A002412, A011541, A334013, A374141, A374168, A374193.
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.