%I A141846
%S A141846 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,
%T A141846 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,
%U A141846 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
%N A141846 Triangle read by rows: A051731 * A051953^(n-k) * 0^(n-k), 1 <= k <= n.
%C A141846 Row sums = A001065: (0, 1, 1, 3, 1, 6, 1, 7, 4, 8,...).
%C A141846 n-th row = (p-1) zeros followed by 1, iff n is prime.
%C A141846 For T(n,k), k divides n if k not = 0.
%F A141846 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.
%e A141846 First few rows of the triangle =
%e A141846 0;
%e A141846 0, 1;
%e A141846 0, 0, 1;
%e A141846 0, 1, 0, 2;
%e A141846 0, 0, 0, 0, 1;
%e A141846 0, 1, 1, 0, 0, 4;
%e A141846 0, 0, 0, 0, 0, 0, 1;
%e A141846 0, 1, 0, 2, 0, 0, 0, 4;
%e A141846 0, 0, 1, 0, 0, 0, 0, 0, 3;
%e A141846 0, 1, 0, 0, 1, 0, 0, 0, 0, 6;
%e A141846 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
%e A141846 0, 1, 1, 2, 0, 4, 0, 0, 0, 0, 0, 8;
%e A141846 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
%e A141846 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 8;
%e A141846 ...
%Y A141846 Cf. A051953, A001065.
%Y A141846 Sequence in context: A035187 A033770 A101668 this_sequence A035202 A128616 
               A101257
%Y A141846 Adjacent sequences: A141843 A141844 A141845 this_sequence A141847 A141848 
               A141849
%K A141846 nonn,tabl
%O A141846 1,10
%A A141846 Gary W. Adamson (qntmpkt(AT)yahoo.com), Jul 11 2008