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!)
A180491 Product of remainders of n mod k, for k = 2,3,4,...,n-1. 3
1, 1, 1, 0, 2, 0, 6, 0, 0, 0, 720, 0, 2160, 0, 0, 0, 2419200, 0, 65318400, 0, 0, 0, 754427520000, 0, 0, 0, 0, 0, 32953394073600000, 0, 311409573995520000, 0, 0, 0, 0, 0, 37269497815783833600000, 0, 0, 0, 7890485108998805913600000000, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
COMMENTS
a(n) is zero where n is composite and is trivially less than or equal to n! when n is prime or 1.
a(n)=0 iff n is composite. See A180492. - Robert G. Wilson v, Sep 09 2010
LINKS
EXAMPLE
a(7) = (7 mod 2) * (7 mod 3) * (7 mod 4) * (7 mod 5) * (7 mod 6) = 1 * 1 * 3 * 2 * 1 = 6.
MATHEMATICA
f[n_] := Times @@ Mod[n, Range[2, n - 1]]; Array[f, 42] (* Robert G. Wilson v, Sep 09 2010 *)
CROSSREFS
Sequence in context: A153059 A151336 A346092 * A329893 A047918 A321981
KEYWORD
nonn
AUTHOR
Carl R. White, Sep 08 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 23 12:38 EDT 2024. Contains 374549 sequences. (Running on oeis4.)