login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A176788 a(n) = (0!! + 1!! + 2!! + 3!! + ... + (n-1)!!) mod n. 2

%I #13 Nov 15 2021 17:40:46

%S 0,0,1,3,0,0,1,7,0,2,6,3,12,10,12,3,13,6,11,7,3,8,14,15,12,22,15,3,19,

%T 12,16,11,30,14,17,15,17,34,9,7,26,24,36,19,42,8,2,3,24,12,48,35,2,42,

%U 52,31,15,22,51,27,32,56,24,27,22,30,6,31,54,52,12,15,7,56,12,15,52,48

%N a(n) = (0!! + 1!! + 2!! + 3!! + ... + (n-1)!!) mod n.

%H Harvey P. Dale, <a href="/A176788/b176788.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = A129981(n-1) mod n.

%e 0!! mod 1 = 1 mod 1 = 0.

%e (0!!+1!!) mod 2 = (1 + 1) mod 2 = 0.

%e (0!!+1!!+2!!) mod 3 = (1 + 1 + 2) mod 3 = 1.

%p A176788 := proc(n)

%p A129981(n-1) mod n ;

%p end proc: # _R. J. Mathar_, Jul 13 2012

%t Table[Mod[Total[Range[0,n-1]!!],n],{n,80}] (* _Harvey P. Dale_, Nov 15 2021 *)

%Y Cf. A049782, A176787, A176789.

%K easy,nonn

%O 1,4

%A _Paolo P. Lava_ & _Giorgio Balzarotti_, Apr 26 2010

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 20 00:03 EDT 2024. Contains 371798 sequences. (Running on oeis4.)