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 A050221 #9 Jul 07 2015 09:39:17
%S A050221 1,1,1,2,1,1,2,1,3,1,3,2,2,1,1,2,2,2,2,5,2,3,2,4,2,1,3,2,1,1,2,2,1,5,
%T A050221 1,4,2,2,1,3,1,2,1,1,4,1,2,1,1,1,1,3,2,2,2,1,1,5,3,1,1,1,2,2,2,1,1,3,
%U A050221 3,1,4,1,2,2,1,3,3,1,3,1,2,1,1,3,1,1,1,2,1,3,1,1,1,2,3,1,1,2,4,4,2,4,1,3,2
%N A050221 a(n) = number of sets of consecutive primes whose arithmetic mean is A060863(n).
%C A050221 Essentially A122821 with the 0's removed.
%F A050221 a(n) = A122821(A060863(n)).
%e A050221 For n=4; A060863(4) = 5. the two sets are 5/1 = 5, (3+5+7)/3 = 5. so a(4)=2.
%t A050221 f[n_]:=Block[{i=1,j,c=0,m},While[Prime[i]<=n, j=1; While[m=Sum[Prime[k],{k,i,i+j-1}]/j; If[m==n,c++ ]; m<n, j++ ]; i++ ]; c]; Select[Table[f[n],{n,160}],#>0&] (* _Ray Chandler_, Oct 03 2006 *)
%Y A050221 Cf. A060863, A122821.
%K A050221 easy,nonn
%O A050221 1,4
%A A050221 _Naohiro Nomoto_, May 08 2003
%E A050221 Extended by _Ray Chandler_, Oct 03 2006