login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A141846
Triangle read by rows: A051731 * A051953^(n-k) * 0^(n-k), 1 <= k <= n.
1
0, 0, 1, 0, 0, 1, 0, 1, 0, 2, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 4, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 2, 0, 0, 0, 4, 0, 0, 1, 0, 0, 0, 0, 0, 3, 0, 1, 0, 0, 1, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 2, 0, 4, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 8
OFFSET
1,10
COMMENTS
Row sums = A001065: (0, 1, 1, 3, 1, 6, 1, 7, 4, 8,...).
n-th row = (p-1) zeros followed by 1, iff n is prime.
For T(n,k), k divides n if k not = 0.
FORMULA
Triangle read by rows, A051731 * A051953^(n-k); where A051953^(n-k) = an infinite lower triangular matrix with A051953 (0, 1, 1, 2, 1, 4, 1, 4, 3, 6, 1, 8,...) in the main diagonal and the rest zeros. A051731 = inverse Mobius transform.
EXAMPLE
First few rows of the triangle =
0;
0, 1;
0, 0, 1;
0, 1, 0, 2;
0, 0, 0, 0, 1;
0, 1, 1, 0, 0, 4;
0, 0, 0, 0, 0, 0, 1;
0, 1, 0, 2, 0, 0, 0, 4;
0, 0, 1, 0, 0, 0, 0, 0, 3;
0, 1, 0, 0, 1, 0, 0, 0, 0, 6;
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
0, 1, 1, 2, 0, 4, 0, 0, 0, 0, 0, 8;
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 8;
...
CROSSREFS
Sequence in context: A262900 A242830 A101668 * A188171 A363807 A330733
KEYWORD
nonn,tabl
AUTHOR
Gary W. Adamson, Jul 11 2008
STATUS
approved