|
%I #26 Apr 30 2017 22:33:00
%S 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,
%T 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,
%U 33,0,0,0,35,0,36,0,0,0,0,0,39,0,0,0,41,0,0
%N a(n) = n! (mod n + 3).
%C Nonzero terms are a(2 * A130290(n) - 2) = A130290(n) for n > 1. - _David A. Corneth_, Apr 30 2017
%H Robert Israel, <a href="/A285982/b285982.txt">Table of n, a(n) for n = 0..10000</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Wilson's_theorem">Wilson's theorem</a>
%F a(n) = A000142(n) (mod n + 3).
%F If n > 1 and a(n) > 0, a(n) = n/2 + 1 and n + 3 is a prime.
%p seq(n! mod (n+3), n=0..100); # _Robert Israel_, Apr 30 2017
%o (PARI) a(n) = n! % (n+3); \\ _Michel Marcus_, Apr 30 2017
%Y Cf. A000142, A061006, A130290.
%K nonn
%O 0,3
%A _Seiichi Manyama_, Apr 29 2017
|
