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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A092410 a(n) = moebius(n)+moebius(n+1). 2
 0, -2, -1, -1, 0, 0, -1, 0, 1, 0, -1, -1, 0, 2, 1, -1, -1, -1, -1, 1, 2, 0, -1, 0, 1, 1, 0, -1, -2, -2, -1, 1, 2, 2, 1, -1, 0, 2, 1, -1, -2, -2, -1, 0, 1, 0, -1, 0, 0, 1, 1, -1, -1, 1, 1, 1, 2, 0, -1, -1, 0, 1, 0, 1, 0, -2, -1, 1, 0, -2, -1, -1, 0, 1, 0, 1, 0, -2, -1, 0, 1, 0, -1, 1, 2, 2, 1, -1, -1, 1, 1, 1, 2, 2, 1, -1, -1, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 FORMULA a(A074819(n)) = a(A068781(n)) = 0. - Reinhard Zumkeller, Sep 04 2015 MAPLE with(numtheory): seq(mobius(n)+mobius(n+1), n=1..110); # Emeric Deutsch, Feb 28 2005 MATHEMATICA Table[MoebiusMu[n] + MoebiusMu[n+1], {n, 1, 100}] (* Amiram Eldar, Sep 09 2022 *) PROG (PARI) for (i=1, 60, print1(", "moebius(i)+moebius(i+1))) (Haskell) a092410 n = a092410_list !! (n-1) a092410_list = zipWith (+) a008683_list \$ tail a008683_list -- Reinhard Zumkeller, Sep 04 2015 CROSSREFS Cf. A008683. Cf. A068781, A074819 (positions of 0's). Sequence in context: A164058 A328712 A319368 * A100204 A073779 A081227 Adjacent sequences: A092407 A092408 A092409 * A092411 A092412 A092413 KEYWORD sign,easy AUTHOR Jon Perry, Mar 22 2004 EXTENSIONS More terms from Emeric Deutsch, Feb 28 2005 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.

Last modified April 25 06:14 EDT 2024. Contains 371964 sequences. (Running on oeis4.)