Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
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!)
A359429 a(n) = 1 if n is cubefree, but not squarefree, otherwise 0. 2
0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1
LINKS
FORMULA
a(n) = A107078(n) * A212793(n) = A212793(n) - A008966(n).
a(n) = [A072411(n) == 2] = [A290107(n) == 2], where [ ] is the Iverson bracket.
a(n) >= A359474(n).
Sum_{k=1..n} a(k) ~ c * n, where c = 1/zeta(3) - 1/zeta(2) = A088453 - A059956 = 0.22398... . - Amiram Eldar, Jan 05 2023
MATHEMATICA
a[n_] := If[Max[FactorInteger[n][[;; , 2]]] == 2, 1, 0]; Array[a, 100] (* Amiram Eldar, Jan 05 2023 *)
PROG
(PARI)
A212793(n) = {f = factor(n); for (i=1, #f~, if ((f[i, 2]) >=3, return(0)); ); return (1); }; \\ From A212793.
A359429(n) = (A212793(n)-issquarefree(n));
CROSSREFS
Characteristic function of A067259.
Sequence in context: A284954 A221151 A359474 * A353470 A342753 A358752
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 04 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 August 18 23:41 EDT 2024. Contains 375284 sequences. (Running on oeis4.)