cp's OEIS Frontend

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.

A265378 Numbers n such that n!3 + 3^9 is prime, where n!3 = n!!! is a triple factorial number (A007661).

This page as a plain text file.
%I A265378 #7 Dec 13 2015 08:08:10
%S A265378 4,8,10,11,14,17,20,22,29,32,44,56,61,173,202,211,215,241,388,410,416,
%T A265378 569,583,680,823,964,1271,1732,2309,2335,2404,2765,3019,3047,4670,
%U A265378 5209,6320,6817,7531,9923,11243,14912,17969,21193,28940
%N A265378 Numbers n such that n!3 + 3^9 is prime, where n!3 = n!!! is a triple factorial number (A007661).
%C A265378 Corresponding primes are: 19687, 19763, 19963, 20563, 32003, 229123, 4208483, 24364003, 72642189283, ...
%C A265378 a(46) > 50000.
%C A265378 Terms > 61 correspond to probable primes.
%H A265378 Henri & Renaud Lifchitz, <a href="http://www.primenumbers.net/prptop/searchform.php?form=n!3+19683&amp;action=Search">PRP Records. Search for n!3+19683.</a>
%H A265378 Joe McLean, <a href="http://web.archive.org/web/20091027034731/http://uk.geocities.com/nassarawa%40btinternet.com/probprim2.htm">Interesting Sources of Probable Primes</a>
%H A265378 OpenPFGW Project, <a href="http://sourceforge.net/projects/openpfgw/">Primality Tester</a>
%e A265378 11!3 + 3^9 = 11*8*5*2 + 19683 = 20563 is prime, so 11 is in the sequence.
%t A265378 MultiFactorial[n_, k_] := If[n < 1, 1, If[n < k + 1, n, n*MultiFactorial[n - k, k]]];
%t A265378 Select[Range[0, 50000], PrimeQ[MultiFactorial[#, 3] + 3^9] &]
%o A265378 (PARI) tf(n) = prod(i=0, (n-1)\3, n-3*i);
%o A265378 for(n=1, 1e4, if(ispseudoprime(tf(n) + 3^9), print1(n , ", "))) \\ _Altug Alkan_, Dec 07 2015
%Y A265378 Cf. A007661, A037082, A084438, A123910, A242994, A261145, A265200.
%K A265378 nonn,more
%O A265378 1,1
%A A265378 _Robert Price_, Dec 07 2015