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 A214073 #7 Aug 06 2012 15:51:35
%S A214073 1,3,1,15,1,3,1,3,1,3,1,3,1,3,2,3,1,3,1,3,1,3,1,3,1,3,2,5,1,5,1,3,1,3,
%T A214073 1,3,1,5,1,3,1,3,1,3,1,3,1,3,1,3,1,3,1,1,1,3,3,3,1,3,1,3,1,3,1,3,1,3,
%U A214073 2,3,1,3,1,3,1,3,1,3,1,3,1,3,1,3,1,3,1,3,1,3,1,3,1,3,1,3,1,3,2
%N A214073 Least m>0 such that 2^n-m and n^2-m are relatively prime.
%H A214073 Clark Kimberling, <a href="/A214073/b214073.txt">Table of n, a(n) for n = 1..1000</a>
%e A214073 gcd(63,35) = 7, gcd(62,34) = 2, gcd(61,33) = 1, so a(6) = 3.
%t A214073 b[n_] := 2^n; c[n_] := n^2;
%t A214073 Table[m = 1; While[GCD[b[n] - m, c[n] - m] != 1, m++]; m, {n, 1, 140}]
%Y A214073 Cf. A071222.
%K A214073 nonn,easy
%O A214073 1,2
%A A214073 _Clark Kimberling_, Jul 26 2012