The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A359833 Dirichlet inverse of A359832, where A359832(n) = 1 if the 2-adic valuation of n is either 0 or odd, otherwise 0. 3
 1, -1, -1, 1, -1, 1, -1, -2, 0, 1, -1, -1, -1, 1, 1, 3, -1, 0, -1, -1, 1, 1, -1, 2, 0, 1, 0, -1, -1, -1, -1, -5, 1, 1, 1, 0, -1, 1, 1, 2, -1, -1, -1, -1, 0, 1, -1, -3, 0, 0, 1, -1, -1, 0, 1, 2, 1, 1, -1, 1, -1, 1, 0, 8, 1, -1, -1, -1, 1, -1, -1, 0, -1, 1, 0, -1, 1, -1, -1, -3, 0, 1, -1, 1, 1, 1, 1, 2, -1, 0, 1, -1, 1, 1, 1, 5, -1, 0, 0, 0, -1, -1, -1, 2, -1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,8 COMMENTS Multiplicative because A359832 is. LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 FORMULA a(1) = 1, and for n > 1, a(n) = -Sum_{d|n, d 2, a(p^e) = -1 if e = 1 and 0 otherwise. - Amiram Eldar, Jan 24 2023 MATHEMATICA f[p_, e_] := If[e == 1, -1, 0]; f[2, e_] := (-1)^e*Fibonacci[e]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Jan 24 2023 *) PROG (PARI) A359833(n) = { my(f=factor(n)); prod(k=1, #f~, if(2==f[k, 1], ((-1)^f[k, 2])*fibonacci(f[k, 2]), -(1==f[k, 2]))); }; \\ Antti Karttunen, Jan 25 2023 CROSSREFS Cf. A000045, A007814, A359832, A359834 (parity of terms). Sequence in context: A298602 A203949 A070200 * A025914 A284977 A025916 Adjacent sequences: A359830 A359831 A359832 * A359834 A359835 A359836 KEYWORD sign,mult AUTHOR Antti Karttunen, Jan 24 2023 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 May 22 13:22 EDT 2024. Contains 372755 sequences. (Running on oeis4.)