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.

A087715 Table read by rows where i-th row consists of primes P of the form P=j*P(i)# -1 or P=j*P(i)# +1 with 0 < j < P(i+1). Here P(r)# = A002110.

This page as a plain text file.
%I A087715 #8 Oct 12 2013 15:14:05
%S A087715 3,3,5,5,7,11,13,17,19,23,29,31,59,61,89,149,151,179,181,211,419,421,
%T A087715 631,839,1049,1051,1259,1471,1889,2099,2309,2311,4621,9239,9241,11549,
%U A087715 11551,13859,18481,20789,23099,25409,25411,30029,90089,120121,150151
%N A087715 Table read by rows where i-th row consists of primes P of the form P=j*P(i)# -1 or P=j*P(i)# +1 with 0 < j < P(i+1). Here P(r)# = A002110.
%e A087715 Table begins:
%e A087715 3,3,5,
%e A087715 5,7,11,13,17,19,23,
%e A087715 29,31,59,61,89,149,151,179,181,
%e A087715 211,419,421,631,839,1049,1051,1259,1471,1889,2099,
%e A087715 2309,2311,4621,9239,9241,11549,11551,13859,18481,20789,23099,25409,25411
%o A087715 (PARI) {for(i=1,6, p=prod(j=1,i, prime(j)); for(j=1, prime(i+1)-1, c=j*p; if(isprime(c-1),print1(c-1 ",")); if(isprime(c+1),print1(c+1 ",")); ););}
%Y A087715 Cf. A087714, A087716, A087728.
%K A087715 tabf,nonn
%O A087715 0,1
%A A087715 _Pierre CAMI_, Sep 29 2003
%E A087715 Edited by _Ray Chandler_, Sep 30 2003