|
|
A143538
|
|
Triangle read by rows, T(n,k) = 1 if k is prime, 0 otherwise; 1 <= k <= n.
|
|
3
|
|
|
0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Triangle read by rows, T(n,k) = 1 if k is prime, 0 otherwise; 1 <= k <= n. A000012 * (A010051 * 0^(n-k)). A010051 * 0^(n-k) = an infinite lower triangular matrix with A010051 (the characteristic function of the primes) as the main diagonal and the rest zeros. The multiplier A000012 takes partial sums of column terms.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
First few rows of the triangle =
0;
0, 1;
0, 1, 1;
0, 1, 1, 0;
0, 1, 1, 0, 1;
0, 1, 1, 0, 1, 0;
0, 1, 1, 0, 1, 0, 1;
...
|
|
MATHEMATICA
|
Table[If[PrimeQ[k], 1, 0], {n, 1, 20}, {k, 1, n}] // Flatten (* G. C. Greubel, Sep 17 2017 *)
|
|
PROG
|
(PARI) for(n=1, 10, for(k=1, n, print1(if(isprime(k), 1, 0), ", "))) \\ G. C. Greubel, Sep 17 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|