



1, 1, 1, 2, 2, 4, 2, 2, 4, 4, 4, 4, 8, 8, 16, 2, 2, 4, 4, 8, 4, 6, 6, 12, 12, 24, 12, 36, 4, 4, 8, 8, 16, 8, 24, 16, 6, 6, 12, 12, 24, 12, 36, 24, 36, 4, 4, 8, 8, 16, 8, 24, 16, 24, 16, 10, 10, 20, 20, 40, 20, 60, 40, 60, 40, 100, 4, 4, 8, 8, 16, 8, 24, 16, 24, 16, 40, 16
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,4


COMMENTS

Row sums = A143231: (1, 2, 8, 12, 40, 24, ...).
T(n,k) is the number of pairs (a,b), where 0 <= a < n, 0 <= b < k, gcd(a,n) != 1, and gcd(b,k) != 1.  Joerg Arndt, Jun 26 2011


LINKS



FORMULA

T(n,k) = phi(n) * phi(k), where phi(n) & phi(k) = Euler's totient function.


EXAMPLE

First few rows of the triangle:
1;
1, 1;
2, 2, 4;
2, 2, 4, 4;
4, 4, 8, 8, 16;
2, 2, 4, 4, 8, 4;
6, 6, 12, 12, 24, 12, 36;
4, 4, 8, 8, 16, 8, 24, 16;
6, 6, 12, 12, 24, 12, 36, 24, 36;
...
T(7,5) = 24 = phi(7) * phi(5) = 6 * 4.


MAPLE

with(numtheory): T := proc(n, k) return phi(n)*phi(k): end: seq(seq(T(n, k), k=1..n), n=1..12); # Nathaniel Johnston, Jun 26 2011


CROSSREFS



KEYWORD



AUTHOR



STATUS

approved



