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 A204663 #25 Apr 03 2023 10:36:12
%S A204663 0,1,3,5,9,13,15,21,23,27,33,35,45,53,55,57,75,79,109,197,221,227,267,
%T A204663 333,413,545,695,703,801,967,1029,1329,1351,1475,1549,1757,2173,2861,
%U A204663 3161,3167,3885,4681,4965,6277,6655,8477,9821,9959,10269,17999,23349,29347,29477,30181,34133,36687,40985,43395,47499
%N A204663 Numbers n such that n!8 + 2 is prime.
%C A204663 n!8 = A114800(n).
%C A204663 See also links in A156165.
%C A204663 For odd k, n!k +-2 is even for all n > k and thus cannot be prime.
%C A204663 a(60) > 50000. - _Robert Price_, Aug 19 2012
%H A204663 C. Caldwell and H. Dubner (Eds): <a href="https://t5k.org/lists/top_ten/">The top ten prime numbers: from the unpublished collections of R. Ondrejka</a> (May 2001), Table 21 F, p. 75.
%H A204663 Ken Davis, <a href="http://mfprimes.free-dc.org">Status of Search for Multifactorial Primes</a>.
%t A204663 Select[Range[0,9999], PrimeQ[Product[# - 8i,{i, 0, Floor[(# - 2)/8]}] + 2] &] (* _Indranil Ghosh_, Mar 13 2017 *)
%o A204663 (PARI) for(n=0,9999,isprime(prod(i=0,(n-2)\8,n-8*i)+2)& print1(n","))
%Y A204663 Cf. A204657, A204658, A204659, A204660, A204661, A204662, A204664, A156165, A156167, A085150, A085148, A085146, A037083, A080778, A002981.
%K A204663 nonn,hard
%O A204663 1,3
%A A204663 _M. F. Hasler_, Jan 17 2012
%E A204663 a(39)-a(59) from _Robert Price_, Aug 19 2012