login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073603 Smallest multiple of n-th prime which is == 1 mod (n+1)-st prime. 0
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

LINKS

Table of n, a(n) for n=1..43.

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);

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

Sequence in context: A034299 A007135 A294070 * A064910 A305580 A191311

Adjacent sequences:  A073600 A073601 A073602 * A073604 A073605 A073606

KEYWORD

nonn

AUTHOR

Amarnath Murthy, Aug 04 2002

EXTENSIONS

Corrected and extended by Sascha Kurz, Aug 10 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 27 01:55 EDT 2020. Contains 337379 sequences. (Running on oeis4.)