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!)
A330323 a(n) = Moebius(n)*Moebius(n+1). 2
-1, 1, 0, 0, -1, -1, 0, 0, 0, -1, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, -1, 1, 0, 0, 1, 1, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, -1, 0, 0, 0, -1, 1, 0, 0, -1, 1, 0, 0, -1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1
LINKS
FORMULA
a(n) = A008683(n * (n+1)). - Christian Krause, Apr 17 2021
MATHEMATICA
Table[MoebiusMu[n] MoebiusMu[n + 1], {n, 100}] (* Wesley Ivan Hurt, Apr 19 2021 *)
PROG
(PARI) a(n) = moebius(n*(n+1)); \\ Michel Marcus, Apr 19 2021
CROSSREFS
Cf. A002378, A008683 (Moebius function), A330324.
Cf. A007674 (positions of nonzero terms).
Sequence in context: A214284 A361466 A191747 * A280933 A133081 A352573
KEYWORD
sign
AUTHOR
N. J. A. Sloane, Dec 12 2019
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 April 25 10:01 EDT 2024. Contains 371967 sequences. (Running on oeis4.)