login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A338974 a(n) is the least prime p such that a(n-1) + p is divisible by a(n-2); a(0)=3, a(1)=5. 1
3, 5, 7, 3, 11, 7, 37, 5, 439, 11, 7013, 5, 42073, 2, 42071, 3, 168281, 7, 673117, 3, 21539741, 7, 86158957, 11, 344635817, 2, 1723179083, 3, 6892716329, 7, 165425191889, 29, 7278708443087, 19, 43672250658503, 71, 2183612532925079, 829, 183423452765705807, 11, 13573335504662229707, 7 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
EXAMPLE
a(2) = 7 is the first prime p such that 5+p is divisible by 3.
a(3) = 3 is the first prime p such that 7+p is divisible by 5.
a(4) = 11 is the first prime p such that 3+p is divisible by 7.
MAPLE
q:= 3: p:= 5: R:= 3, 5:
for i from 2 to 50 do
t:= (-p) mod q;
while not isprime(t) do t:= t+q od;
q:= p; p:= t; R:= R, p;
od:
R;
CROSSREFS
Sequence in context: A121573 A196407 A156030 * A255562 A130140 A051417
KEYWORD
nonn,look
AUTHOR
Robert Israel, Dec 18 2020
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 13:11 EDT 2024. Contains 371913 sequences. (Running on oeis4.)