cp's OEIS Frontend

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.

A084331 a(1) = 2; a(n+1) is the least prime p not already used such that |p-a(n)| is not equal to |a(k+1)-a(k)| for any k < n.

This page as a plain text file.
%I A084331 #7 Aug 23 2014 13:04:20
%S A084331 2,3,5,11,7,17,29,13,31,23,37,59,19,43,71,41,61,97,47,73,107,53,101,
%T A084331 139,67,109,167,79,131,163,83,127,173,89,149,211,103,179,113,181,251,
%U A084331 137,193,257,151,229,311,157,269,359,191,277,373,197,271,389,199,293
%N A084331 a(1) = 2; a(n+1) is the least prime p not already used such that |p-a(n)| is not equal to |a(k+1)-a(k)| for any k < n.
%e A084331 13 (not 19) follows 29 as 29-13 = 16 has not occurred as the difference of successive terms, though 19 has also not occurred earlier but 29-19 = 10 = 17-7.
%Y A084331 Cf. A081145, A084334, A101595.
%K A084331 nonn,easy
%O A084331 1,1
%A A084331 _Amarnath Murthy_ and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Jun 17 2003
%E A084331 Edited and extended by _David Wasserman_, Dec 14 2004