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.

A249808 Triangular table read by rows, a lower right triangular region of square array A(n,k) is the number of times prime p_k has occurred as the smallest prime factor of numbers 1..n.

Original entry on oeis.org

0, 1, 0, 1, 1, 0, 2, 1, 0, 0, 2, 1, 1, 0, 0, 3, 1, 1, 0, 0, 0, 3, 1, 1, 1, 0, 0, 0, 4, 1, 1, 1, 0, 0, 0, 0, 4, 2, 1, 1, 0, 0, 0, 0, 0, 5, 2, 1, 1, 0, 0, 0, 0, 0, 0, 5, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 6, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 6, 2, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 7, 2, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 7, 3, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0
Offset: 1

Views

Author

Antti Karttunen, Nov 06 2014

Keywords

Comments

Table is read by taking n terms from the beginning of row n: A(1,1), A(2,1), A(2,2), A(3,1), A(3,2), A(3,3), ...
See also A249809 for a version with extra zeros removed.

Examples

			The first eleven rows of this triangular table:
  0;
  1, 0;
  1, 1, 0;
  2, 1, 0, 0;
  2, 1, 1, 0, 0;
  3, 1, 1, 0, 0, 0;
  3, 1, 1, 1, 0, 0, 0;
  4, 1, 1, 1, 0, 0, 0, 0;
  4, 2, 1, 1, 0, 0, 0, 0, 0;
  5, 2, 1, 1, 0, 0, 0, 0, 0, 0;
  5, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0;
  ...
		

Crossrefs

A249809 is a more compact version.
A004526 gives the left edge, A001477 the row sums.

Programs

Formula

If row n = 1, A(n,k) = 0, otherwise A(n,k) = A(n-1,k) + [A055396(n) = k], where the subexpression with the Iverson bracket is 1 if the index of the smallest prime dividing n is equal to k, and 0 otherwise. This is a formula for a full square array containing mostly zeros. The terms of this sequence are those collected from the lower right triangle of that square array.
For n > 1, A078898(n) = A(n, A055396(n)).