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!)
A227827 a(0)=3; for n>0, a(n) is the smallest (odd or even) prime p such that the n-th prime p_n divides a(n-1)+p. 2

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

%S 3,3,3,2,5,17,61,7,31,61,113,11,137,109,149,227,197,157,331,71,71,2,

%T 709,619,271,311,1103,751,2459,157,521,241,283,1087,859,631,577,1307,

%U 1301,2039,37,1753,419,727,431,751,443,401,491,2687,61

%N a(0)=3; for n>0, a(n) is the smallest (odd or even) 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.

%C Agrees with A227828 from a(8) on.

%Y Cf. A227826, 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 April 17 01:50 EDT 2024. Contains 371756 sequences. (Running on oeis4.)