|
|
A073603
|
|
Smallest multiple of n-th prime which is == 1 mod (n+1)-st prime.
|
|
1
|
|
|
4, 6, 15, 56, 66, 52, 153, 323, 552, 435, 186, 370, 861, 1505, 2068, 2597, 1770, 671, 3551, 2556, 949, 4898, 6142, 1068, 2425, 5151, 8240, 5778, 3052, 1017, 12446, 14934, 9453, 18626, 11175, 3926, 4239, 20375, 24048, 25777, 16110, 3439, 18336
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(4) = 56 which is 8*7 and 56 ==1 (mod 11)
|
|
MAPLE
|
for i from 1 to 200 do a := msolve(ithprime(i)*n=1, ithprime(i+1)); b[i] := rhs(convert(a, list)[1])*ithprime(i); od:seq(b[k], k=1..200);
# alternative
f:= (p, q)->(1/p mod q)*p:
seq(f(ithprime(i), ithprime(i+1)), i=1..100); # Robert Israel, Apr 21 2021
|
|
MATHEMATICA
|
p = 2; Table[q = NextPrime[p]; i = 2; While[Mod[y = i*p, q] != 1, i++]; p = q; y, {n, 43}] (* Jayanta Basu, Jul 02 2013 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|