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 A190911 #20 Feb 18 2019 04:06:52
%S A190911 3,3,5,3,3,5,3,3,5,3,3,7,3,3,7,3,3,5,3,3,5,3,3,5,3,3,7,3,3,7,3,3,5,3,
%T A190911 3,5,3,3,5,3,3,11,3,3,7,3,3,5,3,3,5,3,3,5,3,3,7,3,3,11,3,3,5,3,3,5,3,
%U A190911 3,5,3,3,7,3,3,7,3,3,5,3,3,5,3,3,5,3,3
%N A190911 Least number coprime to n and n+3.
%C A190911 This is to n+3 as A053670 is to n+1. This is the 3rd row of the array A(k,n) = Least number coprime to n and n+k where A053670 is the 1st row. First n for which a(n) = (3, 5, 7, 11, 13, 17, 19, ...) are A191112 = (1, 3, 12, 42, 165, 3000, 2142, ...).
%H A190911 Nathaniel Johnston, <a href="/A190911/b190911.txt">Table of n, a(n) for n = 1..10000</a>
%e A190911 a(12) = 7 because the prime factors of 12 and 12+3 = 15 are {2, 3, 5} and the next available prime is 7.
%p A190911 A190911 := proc(n) local k: for k from 3 by 2 do if(gcd(k,n)=1 and gcd(k,n+3)=1)then return k: fi: od: end: seq(A190911(n),n=1..100); # _Nathaniel Johnston_, May 26 2011
%Y A190911 Cf. A053669-A053674, A191112.
%K A190911 nonn,easy
%O A190911 1,1
%A A190911 _Jonathan Vos Post_, May 26 2011
%E A190911 a(15) corrected by _Nathaniel Johnston_, May 26 2011