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.

A249421 A(n,k) = exponent of the largest power of n-th prime which divides the product of the elements on row (k-1) of Pascal's triangle; a square array read by antidiagonals.

Original entry on oeis.org

0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 5, 2, 0, 0, 0, 2, 1, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 4, 4, 0, 0, 0, 0, 0, 17, 2, 3, 0, 0, 0, 0, 0, 0, 10, 0, 2, 0, 0, 0, 0, 0, 0, 0, 12, 14, 1, 6, 0, 0, 0, 0, 0, 0, 0, 4, 10, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0, 18, 6, 8, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 13, 6, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 8, 4, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
Offset: 1

Views

Author

Antti Karttunen, Oct 28 2014

Keywords

Comments

Square array A(n,k), where n = row, k = column, read by antidiagonals: A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ....
A(n,k) is A000040(n)-adic valuation of A001142(k-1).

Examples

			The top left corner of the array:
0, 0, 1, 0, 5, 2, 4, 0, 17, 10, 12,  4, 18,  8, 11,  0, 49, 34, 36, 20, 42,
0, 0, 0, 2, 1, 0, 4, 2,  0, 14, 10,  6, 13,  8,  3, 12,  6,  0, 28, 20, 12,
0, 0, 0, 0, 0, 4, 3, 2,  1,  0,  8,  6,  4,  2,  0, 12,  9,  6,  3,  0, 16,
0, 0, 0, 0, 0, 0, 0, 6,  5,  4,  3,  2,  1,  0, 12, 10,  8,  6,  4,  2,  0,
0, 0, 0, 0, 0, 0, 0, 0,  0,  0,  0, 10,  9,  8,  7,  6,  5,  4,  3,  2,  1,
0, 0, 0, 0, 0, 0, 0, 0,  0,  0,  0,  0,  0, 12, 11, 10,  9,  8,  7,  6,  5,
0, 0, 0, 0, 0, 0, 0, 0,  0,  0,  0,  0,  0,  0,  0,  0,  0, 16, 15, 14, 13,
0, 0, 0, 0, 0, 0, 0, 0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0, 18, 17,
...
		

Crossrefs

Transpose: A249422.
Row 1: A187059, Row 2: A249343, Row 3: A249345, Row 4 A249347. (Cf. also A249346).

Programs

Formula

A(n, k) = A249344(n, A001142(k-1)).