|
|
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
|
|
|
FORMULA
|
|
|
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
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|