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.

A333915 Number of ways to represent n as a pyramidal number.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 2, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 3, 2, 1, 1, 2, 2, 1, 1, 2, 1, 2
Offset: 4

Views

Author

Ilya Gutkovskiy, Apr 09 2020

Keywords

Comments

Frequency of n in the array A261720 of pyramidal numbers.

Examples

			a(10) = 2 because 10 is the third tetrahedral (or triangular pyramidal) number and also the second 9-gonal pyramidal number.
a(30) = 3 because 30 is the fourth square pyramidal number, the third octagonal pyramidal number and also the second 29-gonal pyramidal number.
		

Crossrefs