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 A244433 #6 Jul 19 2014 09:32:47
%S A244433 4,12,19,19,59,92,159,159,159,227,227,256,256,256,514,514,706,706,706,
%T A244433 706,706,706,706,1466,1466,1466,1466,1466,1466,5207,5207,5207,5207,
%U A244433 5207,5207,5207,5207,5207,5207,5207,5207,21209,21209,21209,21209,21209,21209,21209,21209,21209,21209,21209,21209,62809,62809,62809,86914,86914,86914,152351
%N A244433 a(n) is the smallest number m such that 2im+1 is composite for all i, 0<i<n+1.
%C A244433 a(3)=a(4)=19, a(7)=a(8)=a(9)=159, ..., a(74)=a(75)=...=a(82)=424783, ... . A244434 gives numbers n such that a(n) does not belong to the set {a(n-1),a(n+1)}.
%e A244433 a(3)=19 because all the three numbers 2*1*19+1=39, 2*2*19+1=77 & 2*3*19+1=115 are composite and 19 is the smallest such number.
%Y A244433 Cf. A071576, A244434, A244435.
%K A244433 nonn
%O A244433 1,1
%A A244433 _Farideh Firoozbakht_, Jul 18 2014