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
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, 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, 52, 31, 15, 22, 51, 27, 32, 56, 24, 27, 22, 30, 6, 31, 54, 52, 12, 15, 7, 56, 12, 15, 52, 48 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
a(n) = A129981(n-1) mod n.
EXAMPLE
0!! mod 1 = 1 mod 1 = 0.
(0!!+1!!) mod 2 = (1 + 1) mod 2 = 0.
(0!!+1!!+2!!) mod 3 = (1 + 1 + 2) mod 3 = 1.
MAPLE
A176788 := proc(n)
A129981(n-1) mod n ;
end proc: # R. J. Mathar, Jul 13 2012
MATHEMATICA
Table[Mod[Total[Range[0, n-1]!!], n], {n, 80}] (* Harvey P. Dale, Nov 15 2021 *)
CROSSREFS
Sequence in context: A080159 A144299 A060514 * A350450 A238129 A344118
KEYWORD
easy,nonn
AUTHOR
STATUS
approved

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 May 9 18:53 EDT 2024. Contains 372354 sequences. (Running on oeis4.)