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 A115061 #12 Dec 19 2016 02:16:40
%S A115061 3,2,2,3,3,3,3,3,5,4,4,5,3,3,5,6,4,4,5,3,4,5,5,7,6,3,3,3,3,9,9,5,4,6,
%T A115061 6,4,6,5,5,6,4,6,6,3,3,7,12,8,3,3,5,4,6,8,6,6,4,4,5,3,6,12,9,3,3,9,10,
%U A115061 8,6,3,5,7,7,6,5,5,7,6,6
%N A115061 a(n) is the number of occurrences of the n-th prime number in A051697.
%C A115061 Except for the second entry, the sequence also holds with respect to A077018.
%C A115061 a(n) equals A162345(n) for n>1 and equals A052288(n-2) for n>2. - _Nathaniel Johnston_, Jun 25 2011
%H A115061 Nathaniel Johnston, <a href="/A115061/b115061.txt">Table of n, a(n) for n = 1..10000</a>
%F A115061 a(n) = (prime(n+1) - prime(n-1))/2 for n>=3. - _Nathaniel Johnston_, Jun 25 2011
%e A115061 The 5th prime number, 11, appears three times in A051697. Therefore a(5) = 3.
%t A115061 a = {3}; For[n = 2, n < 100, n++, c = 0; For[j = Prime[n - 1], j < Prime[n + 1], j++, If[j < Prime[n], If[Prime[n] - j < j - Prime[n - 1], c++ ], If[Not[Prime[n + 1] - j < j - Prime[n]], c++ ]]]; AppendTo[a, c]]; a
%K A115061 nonn,easy
%O A115061 1,1
%A A115061 _Lekraj Beedassy_, Mar 01 2006
%E A115061 Edited and extended by _Stefan Steinerberger_, Oct 27 2007