This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A285982 a(n) = n! (mod n + 3). 1
 1, 1, 2, 0, 3, 0, 0, 0, 5, 0, 6, 0, 0, 0, 8, 0, 9, 0, 0, 0, 11, 0, 0, 0, 0, 0, 14, 0, 15, 0, 0, 0, 0, 0, 18, 0, 0, 0, 20, 0, 21, 0, 0, 0, 23, 0, 0, 0, 0, 0, 26, 0, 0, 0, 0, 0, 29, 0, 30, 0, 0, 0, 0, 0, 33, 0, 0, 0, 35, 0, 36, 0, 0, 0, 0, 0, 39, 0, 0, 0, 41, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Nonzero terms are a(2 * A130290(n) - 2) = A130290(n) for n > 1. - David A. Corneth, Apr 30 2017 LINKS Robert Israel, Table of n, a(n) for n = 0..10000 Wikipedia, Wilson's theorem FORMULA a(n) = A000142(n) (mod n + 3). If n > 1 and a(n) > 0, a(n) = n/2 + 1 and n + 3 is a prime. MAPLE seq(n! mod (n+3), n=0..100); # Robert Israel, Apr 30 2017 PROG (PARI) a(n) = n! % (n+3); \\ Michel Marcus, Apr 30 2017 CROSSREFS Cf. A000142, A061006, A130290. Sequence in context: A080024 A035199 A035229 * A261727 A234579 A109362 Adjacent sequences:  A285979 A285980 A285981 * A285983 A285984 A285985 KEYWORD nonn AUTHOR Seiichi Manyama, Apr 29 2017 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 March 22 17:25 EDT 2019. Contains 321422 sequences. (Running on oeis4.)