|
| |
|
|
A094998
|
|
a(n) = smallest integer multiple of n-th prime, say k*prime(n), such that k*prime(n) == 1 mod j for each integer j with 1<j<prime(n).
|
|
3
| |
|
|
2, 3, 25, 301, 25201, 83161, 7207201, 49008961, 698377681, 2248776129601, 39594522567601, 2599263952084801, 160287943711896001, 4381203794791824001, 386203114510899285601, 130159869178331861668801
(list; graph; refs; listen; history; internal format)
|
| |
| |
|
|
