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!)
A224222 a(0)=3; for n>0, a(n) is the smallest prime q not already in the sequence such that the n-th prime p(n) divides a(n-1)+q. If no such prime q exists, the sequence terminates. 4

%I #21 Dec 12 2015 12:32:09

%S 3,5,7,13,29,37,2,83,31,61,113,11,137,109,149,227,197,157,331,71

%N a(0)=3; for n>0, a(n) is the smallest prime q not already in the sequence such that the n-th prime p(n) divides a(n-1)+q. If no such prime q exists, the sequence terminates.

%C a(20) does not exist, so the sequence terminates. A134204 is a similar sequence for which the termination question is unresolved.

%e After a(3)=13, to find a(4) we look for a prime q such that the fourth prime, 7, divides 13+q, and q=29 works, since 7 divides 13+29 = 42.

%e After a(19)=71 we look for a prime q such that p(20)=71 divides 71+q. The only candidate is q=71. Since it is already in the sequence, the sequence terminates.

%Y Cf. A134204, A224221.

%K nonn,fini,full

%O 0,1

%A _Daniel Drucker_ and _N. J. A. Sloane_, Apr 05 2013

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 20 12:18 EDT 2024. Contains 371839 sequences. (Running on oeis4.)