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 A084758 #25 Oct 30 2018 10:31:02
%S A084758 2,3,5,11,19,23,37,47,59,79,97,113,137,163,191,223,257,293,331,353,
%T A084758 383,431,487,541,587,631,673,733,773,823,881,947,1009,1061,1129,1193,
%U A084758 1277,1367,1439,1531,1601,1697,1777,1871,1949,2053,2129,2203,2309,2411,2521
%N A084758 The slowest increasing sequence of primes such that difference of successive terms is unique.
%C A084758 The sequence of successive differences is 1,2,6,8,4,14,10,12,20,18,16,... Conjecture: every even number is a term of this sequence. For every even number e there exists some k such that a(k) - a(k-1) = e.
%C A084758 The slowest increasing sequence of primes such that each difference between successive terms is unique. - _Zak Seidov_, Feb 10 2015
%H A084758 Zak Seidov, <a href="/A084758/b084758.txt">Table of n, a(n) for n = 1..1000</a>
%e A084758 After 23, the next term is 37 and not 29 or 31 as 29-23= 11-5 =6, 31-23 = 19-11=8.
%t A084758 diffs = {}; prms = {2}; p = 2; Do[While[p = NextPrime[p]; d = p - prms[[-1]]; MemberQ[diffs, d]]; AppendTo[diffs, d]; AppendTo[prms, p], {100}]; prms (* _T. D. Noe_, Nov 01 2011 *)
%Y A084758 Cf. A084759, A121862.
%K A084758 nonn
%O A084758 1,1
%A A084758 _Amarnath Murthy_ and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Jun 17 2003
%E A084758 More terms from _David Wasserman_, Jan 05 2005
%E A084758 Definition corrected by _Zak Seidov_, Nov 01 2011
%E A084758 Definition corrected by _Zak Seidov_, Feb 11 2015