|
Search: id:A143538
|
|
|
| A143538 |
|
Triangle read by rows, T(n,k) = 1 if k is prime, 0 otherwise; 1<=k<=n. |
|
+0
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; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Row sums = A000720, PrimePi(n), the number of primes through n: (0, 1, 2, 2, 3, 3, 4, 4, 4, 4,...).
|
|
FORMULA
|
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.
|
|
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;
...
|
|
CROSSREFS
|
Cf. A010051, A000720.
Sequence in context: A092436 A164056 A163539 this_sequence A011656 A043545 A094754
Adjacent sequences: A143535 A143536 A143537 this_sequence A143539 A143540 A143541
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Aug 23 2008
|
|
|
Search completed in 0.002 seconds
|
