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 A098085 #7 Jul 26 2015 01:41:22
%S A098085 5,11,13,19,29,31,37,43,53,61,71,79,89,97,101,113,127,131,139,149,157,
%T A098085 163,173,191,199,211,211,223,223,241,263,269,277,293,307,311,331,331,
%U A098085 347,353,367,373,389,397,397,419,439,457,457,463,479,487,499,509,521
%N A098085 Primes P(n)+P(n+1)+b(n) = least prime >= P(n)+P(n+1), P(i)=i-th prime, b(n) given in A098084.
%e A098085 P(1) + P(2) = 2 + 3 = 5; least prime >= 5 = 5.
%e A098085 P(2) + P(3) = 3 + 5 = 8; least prime > 8 = 11.
%e A098085 P(3) + P(4) = 5 + 7 = 12; least prime > 12 = 13.
%t A098085 f[n_] := Block[{k = 0, p = Prime[n] + Prime[n + 1]}, While[ !PrimeQ[p + k], k++ ]; p + k]; Table[ f[n], {n, 55}] (* _Robert G. Wilson v_, Sep 24 2004 *)
%K A098085 easy,nonn
%O A098085 1,1
%A A098085 _Pierre CAMI_, Sep 13 2004
%E A098085 More terms from _Robert G. Wilson v_, Sep 25 2004