This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A249355 Remainder of n!+2 divided by n+2 1
 1, 0, 0, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS Antti Karttunen, Table of n, a(n) for n = 0..2048 FORMULA If n+2 = p > 4 is prime, then a(n) = 3. Indeed, it is known that (p-2)! = 1 (mod p) for all primes p. Thus n!+2 = 1+2 = 3 (mod n+2). If n+2 is composite and n > 2 then a(n) = 2.  There are two cases: n+2 = a*b with a < b <= n (so n! is divisible by a*b), or n+2 = a^2 with 2*a <= n (so n! is divisible by a*(2*a)). - Robert Israel, Oct 27 2014 PROG (PARI) a(n)=lift(prod(k=2, n, k, Mod(1, n+2))+2) (PARI) A249355(n)=if(n>2, isprime(n+2)+2, !n) \\ M. F. Hasler, Oct 31 2014 (MAGMA) [(Factorial(n)+2) mod(n+2): n in [0..100]]; // Vincenzo Librandi, Oct 27 2014 CROSSREFS Cf. A055976, A242707. Sequence in context: A096835 A237838 A262880 * A064654 A162229 A056564 Adjacent sequences:  A249352 A249353 A249354 * A249356 A249357 A249358 KEYWORD nonn AUTHOR M. F. Hasler, Oct 26 2014 STATUS approved

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 July 20 05:19 EDT 2019. Contains 325168 sequences. (Running on oeis4.)