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.

A289518 Primes of the form k!4+64, where k!4 is the quadruple factorial number (A007662).

This page as a plain text file.
%I A289518 #11 May 31 2020 17:46:17
%S A289518 67,109,3529,10009,65899,151412689,1267389649,341094033905689,
%T A289518 9807130727058790189,36453104912477522894689,
%U A289518 1008407509171875041482378189,43350768819741354903275421016919057203189,29366774490668885282893783501883117566129541193767295703189
%N A289518 Primes of the form k!4+64, where k!4 is the quadruple factorial number (A007662).
%H A289518 Robert Price, <a href="/A289518/b289518.txt">Table of n, a(n) for n = 1..16</a>
%H A289518 Henri& Renaud Lifchitz, <a href="http://www.primenumbers.net/prptop/searchform.php?form=n4+64&amp;action=Search">PRP Records.Search for n!4+64.</a>
%H A289518 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 A289518 OpenPFGW Project, <a href="http://sourceforge.net/projects/openpfgw/">Primality Tester</a>
%t A289518 MultiFactorial[n_, k_] := If[n<1, 1, n*MultiFactorial[n-k, k]];
%t A289518 Select[Table[MultiFactorial[i, 4] + 64, {i, 0, 100}], PrimeQ[#]&]
%t A289518 Select[Table[Times@@Range[n,1,-4]+64,{n,200}],PrimeQ] (* _Harvey P. Dale_, May 31 2020 *)
%Y A289518 Cf. A291347.
%K A289518 nonn
%O A289518 1,1
%A A289518 _Robert Price_, Sep 02 2017