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.

A188914 a(n) = n*n! + 1 = (n+1)! - n! + 1.

This page as a plain text file.
%I A188914 #25 Aug 03 2022 14:58:01
%S A188914 1,2,5,19,97,601,4321,35281,322561,3265921,36288001,439084801,
%T A188914 5748019201,80951270401,1220496076801,19615115520001,334764638208001,
%U A188914 6046686277632001,115242726703104001,2311256907767808001,48658040163532800001,1072909785605898240001
%N A188914 a(n) = n*n! + 1 = (n+1)! - n! + 1.
%C A188914 It is unknown if all numbers of the form n*n!+1 are squarefree. n*n!+1 is squarefree for 0 < n < 52. It is unknown if there exist infinitely many primes of the form n*n!+1. For primes in this sequence, see A049984.
%F A188914 E.g.f.: exp(x) + x/(1 - x)^2. - _Stefano Spezia_, Aug 03 2022
%t A188914 Table[(n*Factorial[n])+1,{n,0,30}]
%o A188914 (PARI) a(n) = n*n! + 1; \\ _Michel Marcus_, Aug 03 2022
%Y A188914 Cf. A001563, A049984, A094258.
%K A188914 nonn,easy,nice
%O A188914 0,2
%A A188914 _John M. Campbell_, Apr 17 2011
%E A188914 a(0)=1 prepended by _Alois P. Heinz_, Aug 03 2022