|
%I #13 Mar 03 2018 23:39:18
%S 1,1,1,1,2,1,1,1,2,1,1,2,2,3,1,1,1,1,1,2,1,1,2,2,3,2,4,1,1,1,2,1,2,2,
%T 2,1,1,2,1,3,2,2,2,4,1,1,1,2,1,1,2,2,1,3,1,1,2,2,3,2,4,2,4,3,4,1,1,1,
%U 1,1,2,1,2,1,1,2,2,1,1,2,2,3,2,4,2,4,3,4,2,6,1,1,1,2,1,2,2,1,1,3,2,2,2,2,1
%N Triangle read by rows: T(n,m) = number of positive divisors of m that are coprime to n.
%t Flatten@Table[ Count[GCD[Divisors[m], n], 1], {n, 14}, {m, n}] (* _Ray Chandler_, Aug 29 2006 *)
%o (PARI) A122191(n,m) = {local(s);s=0;fordiv(m,d,s=s+(gcd(d,n)==1));s} \\ _Michael B. Porter_, Mar 01 2010
%Y Cf. A116477.
%K nonn,tabl
%O 1,5
%A _Leroy Quet_, Aug 24 2006
%E Extended by _Ray Chandler_, Aug 29 2006
|
