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

%I #24 Jul 26 2022 12:46:29

%S -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,

%T 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,

%U 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

%N a(n) = Moebius(n)*Moebius(n+1).

%H Amiram Eldar, <a href="/A330323/b330323.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A008683(n * (n+1)). - _Christian Krause_, Apr 17 2021

%t Table[MoebiusMu[n] MoebiusMu[n + 1], {n, 100}] (* _Wesley Ivan Hurt_, Apr 19 2021 *)

%o (PARI) a(n) = moebius(n*(n+1)); \\ _Michel Marcus_, Apr 19 2021

%Y Cf. A002378, A008683 (Moebius function), A330324.

%Y Cf. A007674 (positions of nonzero terms).

%K sign

%O 1

%A _N. J. A. Sloane_, Dec 12 2019

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 17 22:23 EDT 2024. Contains 371767 sequences. (Running on oeis4.)