|
| |
|
|
A124224
|
|
Table T(n,k) = reciprocal of k-th number prime to n, modulo n, for 1 <= k <= phi(n).
|
|
1
| |
|
|
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, 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, 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
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,4
|
|
|
COMMENTS
| T(n,k) = smallest m such that A038566(n,k) * m = 1 (mod n).
|
|
|
LINKS
| Eric Weisstein's World of Mathematics, Modular Inverse
|
|
|
EXAMPLE
| Table starts: 0; 1; 1,2; 1,3; 1,2,3,4; 1,5; ....
|
|
|
CROSSREFS
| Cf. A124223, A102057, A038566, A000010 (row lengths).
Sequence in context: A071575 A038569 A020650 * A014599 A075825 A007735
Adjacent sequences: A124221 A124222 A124223 * A124225 A124226 A124227
|
|
|
KEYWORD
| nonn,tabf
|
|
|
AUTHOR
| Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Oct 20 2006
|
| |
|
|
