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 A162564 #14 Mar 02 2019 23:34:56 %S A162564 4,4,9,9,14,22,22,22,22,26,26,34,34,34,34,38,38,46,46,46,46,58,58,58, %T A162564 58,58,58,62,62,74,74,74,74,74,74,82,82,82,82,86,86,94,94,94,94,106, %U A162564 106,106,106,106,106,118,118,118,118,118,118,122,122,134,134,134,134,134 %N A162564 a(n) is the smallest positive integer neither coprime to n! nor a divisor of n!. %C A162564 Alternately, smallest composite not dividing n!. For n > 5, twice the smallest prime greater than n. - _Charles R Greathouse IV_, Apr 04 2013 %H A162564 Charles R Greathouse IV, <a href="/A162564/b162564.txt">Table of n, a(n) for n = 2..10000</a> %F A162564 a(n) = A160995(n!). %p A162564 a := proc (n) local j: for j while gcd(j, factorial(n)) = 1 or `mod`(factorial(n), j) = 0 do end do: j end proc: seq(a(n), n = 2 .. 75); # _Emeric Deutsch_, Jul 23 2009 %o A162564 (PARI) a(n)=my(N=n!,k=n);while(N%k++==0||isprime(k),);k \\ _Charles R Greathouse IV_, Apr 04 2013 %o A162564 (PARI) a(n)=if(n>5,2*nextprime(n+1),(n\2+1)^2) \\ _Charles R Greathouse IV_, Apr 04 2013 %Y A162564 Cf. A160995. %K A162564 nonn %O A162564 2,1 %A A162564 _Leroy Quet_, Jul 06 2009 %E A162564 Extended by _Emeric Deutsch_, Jul 23 2009