The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A100289 Numbers k such that (1!)^2 + (2!)^2 + (3!)^2 + ... + (k!)^2 is prime. 8

%I

%S 2,3,4,5,7,8,10,18,21,42,51,91,133,177,182,310,3175,9566,32841

%N Numbers k such that (1!)^2 + (2!)^2 + (3!)^2 + ... + (k!)^2 is prime.

%C All k <= 310 yield provable primes.

%C Write the sum as S(2,k)-1, where S(m,k) = Sum_{i=0..k} (i!)^m. Let p=1248829. Because p divides S(2,p-1)-1, p divides S(2,k)-1 for all k >= p-1. Hence there are no primes for k >= p-1.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/FactorialSums.html">Factorial Sums</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/IntegerSequencePrimes.html">Integer Sequence Primes</a>

%p L:= [seq((i!)^2, i=1..1000)]:

%p S:= ListTools:-PartialSums(L):

%p select(t -> isprime(S[t]), [\$1..1000]); # _Robert Israel_, Jul 17 2017

%t Select[Range[200], PrimeQ[Total[Range[#]!^2]] &]

%o (PARI) is(n)=ispseudoprime(sum(k=1,n,k!^2)) \\ _Charles R Greathouse IV_, Apr 14 2015

%Y Cf. A100288 (primes of the form (1!)^2 + (2!)^2 + (3!)^2 +...+ (k!)^2).

%Y Cf. A061062 ((0!)^2 + (1!)^2 + (2!)^2 + (3!)^2 +...+ (n!)^2).

%Y Cf. A289947 (k!^6), A290014 (k!^10).

%Y Cf. also A104344.

%K nonn,fini,more

%O 1,1

%A _T. D. Noe_, Nov 11 2004 and Dec 11 2004

%E a(18) from _T. D. Noe_, Feb 15 2006

%E a(19) from _Serge Batalov_, Jul 29 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 12 01:36 EDT 2021. Contains 342912 sequences. (Running on oeis4.)