|
Search: id:A083106
|
|
|
| A083106 |
|
Triangle read by rows in which the n-th row contains n smallest numbers whose product == 1 mod n. |
|
+0
4
|
|
| 1, 1, 3, 1, 2, 5, 1, 3, 5, 7, 1, 2, 3, 4, 9, 1, 5, 7, 11, 13, 19, 1, 2, 3, 4, 5, 6, 13, 1, 3, 5, 7, 9, 11, 13, 15, 1, 2, 4, 5, 7, 8, 10, 11, 13, 1, 3, 7, 9, 11, 13, 17, 19, 21, 31, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 21, 1, 5, 7, 11, 13, 17, 19, 23, 25, 29, 31, 35, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12
(list; table; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
EXAMPLE
|
1
1 3
1 2 5
1 3 5 7
1 2 3 4 9
1 5 7 11 13 19
...
|
|
PROGRAM
|
(PARI) for (n = 1, 70, rowProd = 1; x = 1; for (k = 1, n - 1, while (gcd(x, n) > 1, x = x + 1); print1(x); print1(" "); write1("A083106.txt", x); write1("A083106.txt", " "); rowProd = rowProd*x; x = x + 1); while (rowProd*x%n != 1%n, x = x + 1); print(x); write1("A083106.txt", x); write1("A083106.txt", " "); write1("A083107.txt", x); write1("A083107.txt", " "); write1("A083108.txt", rowProd*x); write1("A083108.txt", " "); write1("A083109.txt", (rowProd*x-1)/n); write1("A083109.txt", " "));
|
|
CROSSREFS
|
Cf. A083107, A083108, A083109.
Sequence in context: A113141 A134225 A136081 this_sequence A033765 A033777 A033801
Adjacent sequences: A083103 A083104 A083105 this_sequence A083107 A083108 A083109
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 22 2003
|
|
EXTENSIONS
|
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Oct 08 2004
|
|
|
Search completed in 0.002 seconds
|
