cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

This page as a plain text file.
%I A227827 #10 Dec 12 2015 12:32:09
%S A227827 3,3,3,2,5,17,61,7,31,61,113,11,137,109,149,227,197,157,331,71,71,2,
%T A227827 709,619,271,311,1103,751,2459,157,521,241,283,1087,859,631,577,1307,
%U A227827 1301,2039,37,1753,419,727,431,751,443,401,491,2687,61
%N 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.
%C A227827 a(0) could be any odd prime - the rest of the sequence is unchanged.
%C A227827 Agrees with A227828 from a(8) on.
%Y A227827 Cf. A227826, A227828.
%K A227827 nonn
%O A227827 0,1
%A A227827 _Daniel Drucker_, Jul 21 2013