login
This site is supported by donations 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

Table of n, a(n) for n=1..78.

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

CROSSREFS

Cf. A049782, A176787, A176789.

Sequence in context: A080159 A144299 A060514 * A238129 A212221 A193291

Adjacent sequences:  A176785 A176786 A176787 * A176789 A176790 A176791

KEYWORD

easy,nonn

AUTHOR

Paolo P. Lava & Giorgio Balzarotti, Apr 26 2010

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 17 11:14 EDT 2019. Contains 326057 sequences. (Running on oeis4.)