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 A035092 #22 Dec 19 2016 04:08:31
%S A035092 1,1,2,1,4,1,4,3,2,1,6,3,4,1,8,1,12,4,30,1,2,3,24,1,18,1,2,4,12,2,16,
%T A035092 12,2,3,6,1,4,13,6,1,10,2,12,6,2,6,4,8,6,9,6,9,28,1,4,1,10,3,6,4,46,4,
%U A035092 4,3,4,1,4,3,22,6,10,2,4,1,2,7,22,3,6,4,6,3,10,1,4,3,2,4,6,1,10,4,2,1
%N A035092 Smallest k such that (n^2)*k + 1 is prime.
%H A035092 Michael De Vlieger, <a href="/A035092/b035092.txt">Table of n, a(n) for n = 1..10000</a>
%H A035092 <a href="/index/Pri#primes_AP">Index entries for sequences related to primes in arithmetic progressions</a>
%e A035092 a(40) = 1 because in 1600k + 1 at k = 1, 1601 is the smallest prime;
%e A035092 a(61) = 46 because in the 46*46*k + 1 sequence the first prime appears at k = 46; it is 171167.
%t A035092 Table[k = 1; While[! PrimeQ[k (n^2) + 1], k++]; k, {n, 94}] (* _Michael De Vlieger_, Dec 17 2016 *)
%o A035092 (PARI)
%o A035092 a(n)=k=1;while(!isprime(k*n^2+1),k++);k
%o A035092 vector(100,n,a(n)) \\ _Derek Orr_, Oct 01 2014
%Y A035092 Analogous case is A034693. See also A005574 and A002496.
%K A035092 nonn,easy
%O A035092 1,3
%A A035092 _Labos Elemer_