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.

A235649 Define a(4)=3 then a(n+1)is the smallest prime P such that a(n)<=P< n with 2*n-P=Q prime and if not possible a(n+1) is the smallest prime P such that P

Original entry on oeis.org

3, 3, 5, 3, 3, 5, 7, 3, 5, 7, 11, 11, 13, 3, 5, 7, 11, 11, 13, 17, 17, 19, 23, 23, 3, 5, 7, 19, 23, 23, 31, 3, 5, 7, 17, 17, 19, 23, 23, 3, 5, 7, 13, 23, 23, 31, 41, 41, 43, 47, 47, 3, 3, 5, 7, 11, 11, 13, 17, 17, 19, 23, 23, 31, 47, 59, 61, 3, 5, 7, 11
Offset: 4

Views

Author

Pierre CAMI, Jan 13 2014

Keywords

Examples

			a(4)=3 as 2*4-3=5 prime by definition
a(5)=3 as 2*5-3=7 prime, a(5)=a(4), a(5)<5
a(6)=5 as 2*6-5=7 prime, a(6)>a(5), a(6)<6
a(7)=5 not possible as 14-5=9 composite
a(7)=7 not possible as 7=7
a(7)=3 as 2*7-3=11 prime
a(8)=3 as 2*8-3=13 prime
		

Crossrefs