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 A108894 #13 Oct 01 2024 18:38:15
%S A108894 0,1,2,11,17,25,38,53,107,245,255,367,719,1077,2189,2853,3236,3511,
%T A108894 3633,4531,4858,5422,7787,8319
%N A108894 Numbers k such that (k!/k#) * 2^k + 1 is prime, where n# = primorial numbers (A034386).
%C A108894 n!/n# is known as n compositorial. All values have been proved prime. No more terms up to 6100. Primality proof for the largest, which has 17219 digits: PFGW Version 1.2.0 for Windows [FFT v23.8] Primality testing (5422!/5422#)*(2^5422)+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 2719 Calling Brillhart-Lehmer-Selfridge with factored part 36.34% (5422!/5422#)*(2^5422)+1 is prime! (66.5095s+0.0129s)
%t A108894 f[n_] := n!/Fold[Times, 1, Prime[ Range[ PrimePi[ n]]]]*2^n + 1; Do[ If[ PrimeQ[ f[n]], Print[n]], {n, 0, 1100}] (* _Robert G. Wilson v_, Jul 18 2005 *)
%Y A108894 Cf. A049420, A091421.
%K A108894 more,nonn
%O A108894 1,3
%A A108894 _Jason Earls_, Jul 15 2005
%E A108894 a(23)-a(24) from _Michael S. Branicky_, Oct 01 2024