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 A169682 #14 Apr 05 2015 11:02:56
%S A169682 2,2,3,3,5,5,5,7,7,7,11,11,11,11,11,13,13,13,13,13,17,17,17,17,17,19,
%T A169682 19,19,19,19,19,19,23,23,23,23,23,23,23,29,29,29,29,29,29,29,31,31,31,
%U A169682 31,31,31,31,31,31,31,31,37,37,37,37,37,37,37,37,37,37,37
%N A169682 Golomb-type sequence over primes.
%C A169682 Suggested by Golomb's sequence A001462.
%C A169682 Terms are primes in nondecreasing order; a(n) gives length of n-th run.
%C A169682 It is understood that a(n) is taken to be the smallest number >= a(n-1) which is compatible with the description.
%H A169682 Ivan Neretin, <a href="/A169682/b169682.txt">Table of n, a(n) for n = 1..10000</a>
%t A169682 a = {2, 2}; Do[a = Join[a, Array[Prime[i]&, a[[i]]]], {i, 2, 12}]; a (* _Ivan Neretin_, Apr 03 2015 *)
%Y A169682 Cf. A001462.
%K A169682 nonn
%O A169682 1,1
%A A169682 _N. J. A. Sloane_, following a posting to the Sequence Fans mailing list by _Eric Angelini_, Apr 13 2010