%I A124224
%S A124224 0,1,1,2,1,3,1,3,2,4,1,5,1,4,5,2,3,6,1,3,5,7,1,5,7,2,4,8,1,7,3,9,1,6,4,
%T A124224 3,9,2,8,7,5,10,1,5,7,11,1,7,9,10,8,11,2,5,3,4,6,12,1,5,3,11,9,13,1,8,
               4,
%U A124224 13,2,11,7,14,1,11,13,7,9,3,5,15,1,9,6,13,7,3,5,15,2,12,14,10,4,11,8,16
%N A124224 Table T(n,k) = reciprocal of k-th number prime to n, modulo n, for 1 
               <= k <= phi(n).
%C A124224 T(n,k) = smallest m such that A038566(n,k) * m = 1 (mod n).
%H A124224 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               ModularInverse.html">Modular Inverse</a>
%e A124224 Table starts: 0; 1; 1,2; 1,3; 1,2,3,4; 1,5; ....
%Y A124224 Cf. A124223, A102057, A038566, A000010 (row lengths).
%Y A124224 Sequence in context: A071575 A038569 A020650 this_sequence A014599 A075825 
               A007735
%Y A124224 Adjacent sequences: A124221 A124222 A124223 this_sequence A124225 A124226 
               A124227
%K A124224 nonn,tabf
%O A124224 1,4
%A A124224 Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Oct 20 2006