A122191 Triangle read by rows: T(n,m) = number of positive divisors of m that are coprime to n.

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, 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, 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

Offset

1,5

Links

Table of n, a(n) for n=1..105.

Mathematica

Flatten@Table[ Count[GCD[Divisors[m], n], 1], {n, 14}, {m, n}] (* Ray Chandler, Aug 29 2006 *)

Prog

(PARI) A122191(n, m) = {local(s); s=0; fordiv(m, d, s=s+(gcd(d, n)==1)); s} \\ Michael B. Porter, Mar 01 2010

Crossrefs

Cf. A116477.

Sequence in context: A109706 A174541 A029444 * A097847 A275120 A144379

Adjacent sequences: A122188 A122189 A122190 * A122192 A122193 A122194

Keyword

nonn,tabl

Author

Leroy Quet, Aug 24 2006

Extensions

Extended by Ray Chandler, Aug 29 2006

Status

approved