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.

A101595 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 A101595 #13 Nov 19 2014 09:21:57
%S A101595 2,3,5,11,7,17,29,13,31,19,23,37,53,43,41,61,47,71,79,59,89,67,101,73,
%T A101595 109,83,127,97,137,103,131,107,139,181,113,151,173,167,149,197,157,
%U A101595 211,163,223,179,229,191,257,193,239,307,199,251,277,227,283,241,233,311
%N A101595 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.
%C A101595 Apparently a rearrangement of the primes. Among the first 10000 terms the only missing primes are prime(9530,9532,9533,9541,9552,9556,9557,9560,9562,9563,...) = (99259,99289,99317,99401,99559,99581,99607,99643,99667,99679,...). - _Zak Seidov_, Nov 18 2014
%H A101595 Zak Seidov, <a href="/A101595/a101595.png">Two graphs.</a>
%Y A101595 Cf. A084331.
%K A101595 easy,nonn
%O A101595 1,1
%A A101595 _David Wasserman_, Dec 14 2004