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.

A283559 Numbers k such that k![10]-2 is prime, where k![10] is the ten-fold multifactorial.

This page as a plain text file.
%I A283559 #11 Apr 03 2023 10:36:13
%S A283559 4,5,7,9,13,15,21,25,29,31,33,41,45,49,77,195,197,199,211,309,319,345,
%T A283559 349,395,509,533,539,597,615,705,781,803,869,969,1313,1317,1331,1335,
%U A283559 1337,1429,1597,2121,2133,2513,2547,2733,2885,2931,3701,3709,4681,5911,5933,6125,8191,10637,10679,10845,14901,15629,17165,21691,21867,23119,27033,28601,31245,31957,33289,35773,45011,51079,63241,81369,92615
%N A283559 Numbers k such that k![10]-2 is prime, where k![10] is the ten-fold multifactorial.
%C A283559 a(76) > 50000.
%C A283559 The first 13 primes associated with this sequence: 2, 3, 5, 7, 37, 73, 229, 1873, 4957, 7159, 29599, 293599, 2953123.
%H A283559 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 A283559 Ken Davis, <a href="http://mfprimes.free-dc.org">Status of Search for Multifactorial Primes</a>.
%t A283559 MultiFactorial[n_, k_] := If[n < 1, 1, n*MultiFactorial[n - k, k]];
%t A283559 Select[Range[2, 50000], PrimeQ[MultiFactorial[#, 10] - 2] &]
%Y A283559 Cf. A076185, A085158, A094144, A204657.
%K A283559 nonn
%O A283559 1,1
%A A283559 _Robert Price_, Mar 10 2017
%E A283559 a(72)-a(75) from _Robert Price_, Apr 03 2017