Triangle T(n,k): T(n,k) = phi(k) if k divides n, T(n,k)=0 otherwise (n >= 1, 1<=k<=n). T(n,k) = number of elements of order k in cyclic group of order n.
A054522
Triangle T(n,k): T(n,k) = phi(k) if k divides n, T(n,k)=0 otherwise (n >= 1, 1<=k<=n). T(n,k) = number of elements of order k in cyclic group of order n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =0a(5) =2a(6) =1a(7) =1a(8) =0a(9) =2a(10) =1a(11) =0a(12) =0a(13) =0a(14) =4a(15) =1a(16) =1a(17) =2a(18) =0a(19) =0a(20) =2a(21) =1a(22) =0a(23) =0a(24) =0a(25) =0a(26) =0a(27) =6a(28) =1a(29) =1
External references
- oeis: A054522