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.

A046029 Numbers k such that (k!)^2 + 1 is prime.

This page as a plain text file.
%I A046029 #48 Jun 25 2025 20:46:52
%S A046029 0,1,2,3,4,5,9,10,11,13,24,65,76,127162
%N A046029 Numbers k such that (k!)^2 + 1 is prime.
%C A046029 a(14) > 780. - _Ralf Stephan_, Oct 21 2002
%C A046029 a(14) > 2500. - Gabriel Cunningham (gcasey(AT)mit.edu), Feb 23 2004
%C A046029 a(14) > 10000. - _Charles R Greathouse IV_, Nov 16 2006
%C A046029 a(14) > 16000. - _Robert Price_, Aug 13 2011
%C A046029 a(15) > 150000. - _Ryan Propper_, Jun 25 2025
%D A046029 H. Ibstedt, A Few Smarandache Sequences, Smarandache Notions Journal, Vol. 8, No. 1-2-3, 1997, 170-183.
%H A046029 Mike Oakes, <a href="http://groups.yahoo.com/group/primeform/message/10881">Re: Gaussian primorial and factorial primes</a>, Primeform, Dec 21 2010.
%H A046029 Mike Oakes, Andrew Walker, David Broadhurst, <a href="/A046029/a046029.txt">Gaussian primorial and factorial primes</a>, digest of 7 messages in primeform Yahoo group, Dec 20 - Dec 21, 2010.
%H A046029 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Factorial.html">Factorial</a>
%e A046029 9 is a term because (9!)^2 + 1 is prime.
%t A046029 Do[ If[ PrimeQ[n!^2 + 1], Print[n]], {n, 500}] (* _Robert G. Wilson v_, Apr 14 2004 *)
%t A046029 Select[Range[1000], PrimeQ[(#!^2 + 1)] &] (* _Vincenzo Librandi_, May 28 2015 *)
%o A046029 (Magma) [n: n in [0..90] |IsPrime(Factorial(n)^2+1)]; // _Vincenzo Librandi_, May 28 2015
%Y A046029 Cf. A020549, A051739.
%K A046029 nonn,more,hard
%O A046029 1,3
%A A046029 _Eric W. Weisstein_
%E A046029 a(14) from _Ryan Propper_, Jun 25 2025