|
| |
|
|
A143466
|
|
Odious count triangle, T(n,k) = A010060(n) * A010060(k); 1<=k<=n.
|
|
1
| |
|
|
1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Row sums = (1, 2, 0, 3, 0, 0, 4, 5, 0, 0, 0, 6,...) = A102390, the Odious count sequence starting with offset 1.
Equals row sums of triangle A143466 starting with offset 1. [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Aug 17 2008]
|
|
|
FORMULA
| Odious count triangle, T(n,k) = A010060(n) * A010060(k); 1<=k<=n. If row n = an Odious number (1, 2, 4, 7, 8,...) the row = the first n terms of the M-T sequence (A010060) starting with offset 1: (1, 1, 0, 1, 0, 0, 1, 1,...); otherwise 0. Let X = an infinite lower triangular matrix with (1, 1, 0, 1, 0, 0, 1,...) in the main diagonal and the rest zeros, (i.e. A010060 * 0^(n-k), with offset 1). Then perform X * A000012 * X = triangle A143466.
|
|
|
EXAMPLE
| First few rows of the triangle =
1;
1, 1;
0, 0, 0;
1, 1, 0, 1;
0, 0, 0, 0, 0;
0, 0, 0, 0, 0, 0;
1, 1, 0, 1, 0, 0, 1;
...
T(7,3) = 1 since given the first few terms of the M-T sequence starting with offset 1, (1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1,...), product of 7-th and 3-rd terms = 1.
|
|
|
CROSSREFS
| Cf. A010060, A102390.
A143466 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Aug 17 2008]
Sequence in context: A129405 A127001 A068431 * A117908 A115360 A088911
Adjacent sequences: A143463 A143464 A143465 * A143467 A143468 A143469
|
|
|
KEYWORD
| nonn,tabl
|
|
|
AUTHOR
| Gary W. Adamson (qntmpkt(AT)yahoo.com), Aug 17 2008
|
| |
|
|
