|
Search: id:A066220
|
|
|
| A066220 |
|
If prime(k) denotes the k-th prime, a(k) is the least positive number n such that t^n = 1 mod (prime(k) - t) for 0 < t < prime(k). |
|
+0
1
|
|
| 1, 1, 2, 4, 6, 60, 60, 120, 144, 7920, 55440, 18480, 7920, 27720, 2520, 637560, 8288280, 480720240, 480720240, 480720240, 480720240, 480720240, 1442160720, 9854764920, 59128589520, 59128589520, 147821473800, 670124014560
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
EXAMPLE
|
a(5) = 6 because 2^6 = 1 mod 9, 3^6 = 1 mod 8, 4^6 = 1 mod 7, 5^6 = 1 mod 6, 6^6 = 1 mod 5, 7^6 = 1 mod 4, 8^6 = 1 mod 3, 9^6 = 1 mod 2 and 6 is the minimal exponent that verifies this.
|
|
CROSSREFS
|
Sequence in context: A056696 A045662 A084324 this_sequence A009257 A098757 A056012
Adjacent sequences: A066217 A066218 A066219 this_sequence A066221 A066222 A066223
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Michael Ulm (taga(AT)hades.math.uni-rostock.de), Dec 18 2001
|
|
|
Search completed in 0.002 seconds
|
