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.

A336091 Number of ordered ways of writing the n-th n-gonal pyramidal number as a sum of n n-gonal pyramidal numbers (with 0's allowed).

Original entry on oeis.org

1, 1, 2, 3, 10, 5, 246, 1519, 19678, 74601, 690490, 21026621, 301528272, 4397123315, 71221546592, 1001245733295, 19276579678736, 368677642975493, 6820451221691646, 136000924000323691, 3069656935024721420, 69646109074231173897, 1641880679174919030100
Offset: 0

Views

Author

Ilya Gutkovskiy, Oct 04 2020

Keywords

Examples

			a(3) = 3 because the third tetrahedral (or triangular pyramidal) number is 10 and we have [10, 0, 0], [0, 10, 0] and [0, 0, 10].
		

Crossrefs

Programs

  • Mathematica
    Table[SeriesCoefficient[Sum[x^(k (k + 1) (k (n - 2) - n + 5)/6), {k, 0, n}]^n, {x, 0, n (n + 1) (n^2 - 3 n + 5)/6}], {n, 0, 22}]

Formula

a(n) = [x^p(n,n)] (Sum_{k=0..n} x^p(n,k))^n, where p(n,k) = k * (k + 1) * (k * (n - 2) - n + 5) / 6 is the k-th n-gonal pyramidal number.