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.

A176815 Radius of the second-shortest interval (of positive length) centered at prime(n) that has prime endpoints, (zero if no solution exists).

This page as a plain text file.
%I A176815 #2 Mar 31 2012 12:38:36
%S A176815 0,0,0,0,8,10,12,0,18,18,28,24,18,30,24,30,30,42,30,18,30,48,30,42,54,
%T A176815 30,24,24,42,54,30,42,36,42,42,42,54,60,60,24,48,30,60,36,60,72,18,84,
%U A176815 36,78,36,42,42,18,24,30,42,60,36,30,84,54,30,48,84,66,48,60,54,72,36
%N A176815 Radius of the second-shortest interval (of positive length) centered at prime(n) that has prime endpoints, (zero if no solution exists).
%C A176815 7+-10->primes;but 7-10=-3,so,term #4(for number 7) is 0, 11+-8->primes, 13+-10->primes, 17+-12->primes, 19+-22->primes;but 19-22=-3,so,term #8(for number 19)is 0, 23+-18->primes,..
%t A176815 f[n_]:=Module[{a=1},While[ !PrimeQ[n-a]||!PrimeQ[n+a],a++ ];r[n,++a]]; r[n_,k_]:=Module[{a=k},While[ !PrimeQ[n-a]||!PrimeQ[n+a],a++ ];If[a>n,0,a]]; Table[f[Prime[n]],{n,1,5!}]
%Y A176815 Cf. A078611
%K A176815 nonn
%O A176815 1,5
%A A176815 _Vladimir Joseph Stephan Orlovsky_, Apr 26 2010