|
Search: id:A073603
|
|
|
| A073603 |
|
Smallest multiple of n-th prime which is == 1 mod (n+1)-st prime. |
|
+0
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; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
a(5) = 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);
|
|
CROSSREFS
|
Sequence in context: A045907 A034299 A007135 this_sequence A064910 A086714 A009463
Adjacent sequences: A073600 A073601 A073602 this_sequence A073604 A073605 A073606
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 04 2002
|
|
EXTENSIONS
|
Corrected and extended by Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Aug 10 2002
|
|
|
Search completed in 0.002 seconds
|
