|
|
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.
|
|
3
|
|
|
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
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,7
|
|
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.
|
|
LINKS
|
|
|
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.
|
|
EXAMPLE
|
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;
...
|
|
MATHEMATICA
|
FoldList[Append[MapAt[# + 1 &, #1, PrimePi@ FactorInteger[#2][[1, 1]]], 0] &, {0}, Range[2, 15]] // Flatten (* Michael De Vlieger, Nov 24 2017 *)
|
|
PROG
|
(Scheme)
(define (A249808bi row col) (if (= 1 row) 0 (+ (A249808bi (- row 1) col) (if (= (A055396 row) col) 1 0))))
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|