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.

A288152 Numbers k such that k!6 + 8 is prime, where k!6 is the sextuple factorial number (A085158 ).

This page as a plain text file.
%I A288152 #6 Jun 05 2017 23:09:15
%S A288152 3,5,21,29,41,65,243,305,389,509,819,1653,7493,8613,8619,10257,11829,
%T A288152 12977,15651,24341,29367,31629,40173
%N A288152 Numbers k such that k!6 + 8 is prime, where k!6 is the sextuple factorial number (A085158 ).
%C A288152 Corresponding primes are: 11, 13, 8513, 623653, 894930583, 8549258359016383, ...
%C A288152 a(24) > 50000.
%C A288152 Terms > 41 correspond to probable primes.
%H A288152 Henri & Renaud Lifchitz, <a href="http://www.primenumbers.net/prptop/searchform.php?form=n!6+8&amp;action=Search">PRP Records. Search for n!6+8.</a>
%H A288152 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 A288152 OpenPFGW Project, <a href="http://sourceforge.net/projects/openpfgw/">Primality Tester</a>
%e A288152 21!6 + 8 = 21*15*9*3 + 8 = 8513 is prime, so 21 is in the sequence.
%t A288152 MultiFactorial[n_, k_] := If[n < 1, 1, n*MultiFactorial[n - k, k]];
%t A288152 Select[Range[0, 50000], PrimeQ[MultiFactorial[#, 6] + 8] &]
%Y A288152 Cf. A007661, A037082, A084438, A123910, A242994.
%K A288152 nonn,more
%O A288152 1,1
%A A288152 _Robert Price_, Jun 05 2017