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.
%I A078498 #6 Oct 07 2011 16:48:57
%S A078498 1,1,1,2,1,2,2,1,2,4,1,1,2,3,1,2,1,3,4,3,5,2,1,1,5,4,4,3,5,2,3,2,1,6,
%T A078498 5,1,2,3,7,5,5,7,2,10,5,8,1,2,5,2,1,1,2,7,1,2,9,4,4,7,6,6,3,5,6,3,1,7,
%U A078498 5,1,5,6,5,4,3,2,5,2,2,4,3,4,3,14,3,4,4,2,9,2,7,9,8,7,4,13
%N A078498 Let q(n) be the prime defined in A078497; sequence gives (q(n)-prime(n))/6.
%F A078498 For n>4 a(n)=( min{p : p>prime(n), p and 2*prime(n)-p are primes} - prime(n) ) / 6.
%e A078498 a(6)=1, a(25)=5.
%t A078498 Table[p = Prime[i]; j = 0; While[j++; df = 6*j; ! ((PrimeQ[p + df]) && (PrimeQ[p - df]))]; j, {i, 5, 100}]
%Y A078498 Cf. A078496, A078497.
%K A078498 nonn,easy
%O A078498 5,4
%A A078498 Serhat Sevki Dincer (sevki(AT)ug.bilkent.edu.tr), Nov 27 2002
%E A078498 More terms from Pab Ter (pabrlos(AT)yahoo.com), May 27 2004