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 A255615 #16 Dec 12 2018 03:17:09
%S A255615 0,0,0,3,1,2,1,0,0,1,3,1,1,3,1,1,1,1,0,1,1,3,0,0,0,2,1,0,1,0,1,2,1,2,
%T A255615 0,0,2,0,0,1,2,1,1,0,0,0,4,3,2,2,2,0,0,4,5,1,2,1,1,2,0,1,0,1,0,0,0,2,
%U A255615 0,0,1,1,2,1,2,1,0,1,2,2,4,4,1,0,0,1,1
%N A255615 a(n) is the number of even A098550 terms less than 2*prime(n) but occurring after 2*prime(n).
%H A255615 Peter J. C. Moses, <a href="/A255615/b255615.txt">Table of n, a(n) for n = 1..1000</a>
%H A255615 David L. Applegate, Hans Havermann, Bob Selcoe, Vladimir Shevelev, N. J. A. Sloane, and Reinhard Zumkeller, <a href="http://arxiv.org/abs/1501.01669">The Yellowstone Permutation</a>, arXiv preprint arXiv:1501.01669 [math.NT], 2015.
%e A255615 Let A=A098550. Let n=4, prime(4)=7, 2*prime(4)=14 = A(8). We have 2=A(2), 4=A(4), 6=A(10), 8=A(6), 10=A(16), 12=A(12). Thus 6,10 and 12 appear in A later than 14. So a(4)=3.
%t A255615 terms = 87;
%t A255615 f[lst_] := Block[{k = 4}, While[ GCD[ lst[[-2]], k] == 1 || GCD[ lst[[-1]], k] > 1 || MemberQ[lst, k], k++]; Append[lst, k]]; A098550 = Nest[f, {1, 2, 3}, 12 terms] ;
%t A255615 a[n_] := Module[{p, pos}, p = Prime[n]; pos = FirstPosition[A098550, 2 p][[1]]; Count[A098550[[pos+1 ;; 12 terms]], k_ /; EvenQ[k] && k < 2 p]];
%t A255615 Array[a, terms] (* _Jean-François Alcover_, Dec 12 2018, after _Robert G. Wilson v_ in A098550 *)
%Y A255615 Cf. A098550, A000040.
%K A255615 nonn
%O A255615 1,4
%A A255615 _Vladimir Shevelev_, Feb 28 2015
%E A255615 More terms from _Peter J. C. Moses_, Feb 28 2015