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.

A374498 Square array read by antidiagonals: row n lists n-gonal pyramidal numbers that are products of smaller n-gonal pyramidal numbers.

Original entry on oeis.org

1, 36, 1, 45, 560, 1, 210, 19600, 4900, 1, 300, 43680, 513590, 56448, 1, 378, 45760, 333833500, 127008, 4750, 1, 630, 893200, 711410700, 259200, 1926049000, 58372180608, 1
Offset: 2

Views

Author

Pontus von Brömssen, Jul 09 2024

Keywords

Comments

If there are only finitely many solutions for a certain value of n, the rest of that row is filled with 0's.
The first term in each row is 1, because 1 is an n-gonal pyramidal number for every n and it equals the empty product.

Examples

			Array begins:
  n\k| 1     2          3            4
  ---+--------------------------------
  2  | 1    36         45          210
  3  | 1   560      19600        43680
  4  | 1  4900     513590    333833500
  5  | 1 56448     127008       259200
  6  | 1  4750 1926049000 655578709500
		

Crossrefs

Cf. A080851, A374370, A374499 (second column).
Rows: A068143 (n=2 except the first term), A364151 (n=3), A374500 (n=4), A374501 (n=5), A374502 (n=6).