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!)
A359465 a(n) = 1 if n is an odd squarefree number with an even number of prime factors, otherwise 0. 3
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1
LINKS
FORMULA
a(n) = A000035(n) * A353629(n).
a(n) = A008966(n) * A353557(n) = A008966(n) * A353675(n).
a(n) = A065043(n) * A323239(n) = A323239(n) * A359464(n).
a(n) = [A343370(n) = 1], where [ ] is the Iverson bracket.
For all n >= 1, a(n) >= A353481(n).
Sum_{k=1..n} a(k) ~ c * n, where c = 2/Pi^2 (A185197). - Amiram Eldar, Jan 05 2023
MATHEMATICA
a[n_] := If[OddQ[n] && MoebiusMu[n] == 1, 1, 0]; Array[a, 100] (* Amiram Eldar, Jan 05 2023 *)
PROG
(PARI)
A065043(n) = (1 - (bigomega(n)%2));
A323239(n) = ((n%2) && issquarefree(n));
A359465(n) = (A323239(n)&&A065043(n));
CROSSREFS
Characteristic function of A056913.
After n=1 differs from A353481 for the next time at n=1155, where a(1155)=1, while A353481(1155)=0. Cf. also A046390.
Sequence in context: A358008 A249832 A014041 * A353675 A015868 A323402
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 02 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 4 14:31 EDT 2024. Contains 372243 sequences. (Running on oeis4.)