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 A272903 #42 May 12 2019 14:05:54
%S A272903 2,0,1,1,1,1,5,1,1,1,1,2,1,2,1,1,5,2,1,1,1,4,5,1,17,1,3,1,13,1,1,2,3,
%T A272903 2,1,2,5,1,1,4,1,2,5,1,1,1,13,1,11,1,3,5,1,1,1,1,5,7,1,1,11,2,3,1,1,1,
%U A272903 7,1,3,1,11,3,5,2,3,1,17,3,7,4,3,7,1,3,1,1,3,2,1,3,11,2,1,1,7,1,17,5,9
%N A272903 Least nonnegative integer x such that n^2+nx-2n-x is prime.
%C A272903 The offset is 2 because n^2+nx-2n-x = -1 for n = 1 and all x.
%C A272903 a(n) seems to be exclusively prime or a product of two previous terms, and less than n excluding n = 2. x is most frequently equal to 1.
%H A272903 Cody M. Haderlie, <a href="/A272903/b272903.txt">Table of n, a(n) for n = 2..10000</a>
%t A272903 Table[Min[DeleteCases[Table[If[PrimeQ[n^2+n*x-2n-x],x],{x,0,n}],Null]],{n,2,100}] (*Assuming that x<n.*)
%t A272903 lni[n_]:=Module[{x=0},While[!PrimeQ[n^2+n*x-2n-x],x++];x]; Array[lni,100,2] (* _Harvey P. Dale_, May 12 2019 *)
%K A272903 nonn
%O A272903 2,1
%A A272903 _Cody M. Haderlie_, May 09 2016