|
%I #13 Apr 09 2014 10:16:58
%S 1,1,1,1,2,2,2,0,2,0,4,2,2,0,2,0,2,0,6,3,3,3,4,3,3,4,4,3,6,3,6,3,4,2,
%T 0,2,4,0,4,2,0,2,10,7,7,7,4,3,4,3,3,3,1,3,4,3,4,3,12,5,12,5,12,12,6,2,
%U 2,6,2,6,6,2,8,4,8,8,4,8,8,4,8,0,8,0,8,0,8,0,8,0,8,0,8,0,8,0,16,8
%N Array where a(1,1)=1 and m-th term of n-th row is number of terms of (n-1)th row which are coprime to the m-th positive integer coprime to n and <=n.
%C Number of terms in row n is A000010(n).
%C For the purpose of this sequence, GCD(0,n)=n. Since being "coprime" means that the greatest divisor common to two numbers is 1, 0 is only coprime to 1. [From _Diana L. Mecum_, Aug 07 2008]
%H Diana Mecum, <a href="/A112792/b112792.txt">Table of n, a(n) for n = 1..9832</a> [From _Diana L. Mecum_, Aug 07 2008]
%e The irregular array's 5th row is [2,0,2,0]. The integers coprime to 6 and <= 6 are 1 and 5. In the 5th row there are 4 terms coprime to 1 and there are 2 terms coprime to 5. So the 6th row of the array is [4,2].
%Y Cf. A000010, A112793.
%K nonn,tabf,look
%O 1,5
%A _Leroy Quet_, Dec 31 2005
%E Terms 33 through 9832 (with b-file) from _Diana L. Mecum_, Aug 07 2008
|
