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!)
A372864 Numbers k such that A372720(k) = 0. 2
1, 500, 578, 722, 750, 1058, 1500, 1682, 1922, 2646, 2744, 3430, 3645, 4800, 5202, 5346, 5476, 5488, 5625, 6318, 6400, 6724, 7168, 7396, 8000, 8836, 10092, 10976, 11236, 11532, 11979, 12005, 13068, 13924, 14450, 14884, 15309, 16810, 16875, 16896, 18050, 18225 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Let tau = A000005, let omega = A001221, let f = A008479, and let g = A372720.
For squarefree k, A372720(k) >= 0, since f(k) = 1 while tau(k) = 2^omega(k).
For prime power p^m, A372720(p^m) = 1, since f(p^m) = m while tau(k) = m+1.
Therefore, apart from a(1) = 1, this sequence is a proper subset of A126706.
In the sequence R = {k = m*s : rad(m) | s, s > 1 in A120944}, there is a smallest term k such that g(k) <= 0 and a largest term k such that g(k) is positive. For instance, in A033845 where s = 6, only {6, 12, 18, 24, 36, 48, 54, 72, 96, 108, 144, 192, 216, 288, 432, 576, 864} are such that g(k) > 0.
Apart from terms in this sequence, all the rest of the terms k in R are such that g(k) is negative.
There are no 3-smooth numbers k > 1 in this sequence, however there are 3 terms {500, 6400, 8000} in A033846 (with s = rad(k) = 10). For s = 2*3*23, there are 6 terms {19044, 25392, 38088, 70656, 536544, 953856}.
Conjecture: proper subset of A361098, hence of A360765 and A360768. This is to say that k = a(n) is such that A003557(k) >= A119288(k), i.e., k/rad(k) >= second smallest prime factor of k, and A003557(k) > A053669(k), where A053669(k) is the smallest prime q that does not divide k.
LINKS
EXAMPLE
a(1) = 1 since tau(1) - f(1) = 1 - 1 = 0.
a(2) = 500 = 2^2 * 5*3, since tau(500) - f(500)
= (2+1)*(3+1) - card({10,20,40,50,80,100,160,200,250,320,400,500})
= 12 - 12 = 0.
a(3) = 578 = 2*17^2, since tau(578) - f(578)
= (1+1)*(2+1) - card({34,68,136,272,544,578})
= 6 - 6 = 0, etc.
MATHEMATICA
rad[x_] := rad[x] = Times @@ FactorInteger[x][[All, 1]]; Position[Table[r = rad[n]; DivisorSigma[0, n] - Count[Range[n/r], _?(Divisible[r, rad[#]] &)], {n, 20000}], _?(# == 0 &)][[All, 1]]
CROSSREFS
Sequence in context: A220024 A251813 A372147 * A045215 A194085 A216114
KEYWORD
nonn
AUTHOR
Michael De Vlieger, Jun 02 2024
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 June 26 02:31 EDT 2024. Contains 373715 sequences. (Running on oeis4.)