The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A227826 a(0)=3; for n>0, a(n) is the smallest odd prime p such that the n-th prime p_n divides a(n-1)+p. 2

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

%S 3,3,3,7,7,37,41,61,53,131,43,19,277,379,137,239,79,157,331,71,71,367,

%T 107,59,653,317,491,127,2441,829,1657,883,1213,157,677,1409,101,1783,

%U 173,829,3323,257,467,1061,97,691,503,1607,1069,293,1997

%N a(0)=3; for n>0, a(n) is the smallest odd prime p such that the n-th prime p_n divides a(n-1)+p.

%C a(0) could be any odd prime - the rest of the sequence is unchanged.

%Y Cf. A227827, A227828.

%K nonn

%O 0,1

%A _Daniel Drucker_, Jul 21 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 May 25 13:43 EDT 2024. Contains 372788 sequences. (Running on oeis4.)