OFFSET
1,1
COMMENTS
Zelinsky (2002) called these numbers p-generators. He proved that these are the tau numbers k such that for any prime p, if p does not divide k then p*k is also a tau number. He used these numbers to prove that the number of tau numbers not exceeding m is > pi(m)/2 for all m > 7.42*10^13, where pi(m) = A000720(m).
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
Joshua Zelinsky, Tau Numbers: A Partial Proof of a Conjecture and Other Results, Journal of Integer Sequences, Vol. 5 (2002), Article 02.2.8.
EXAMPLE
8 is a term since 8/tau(8) = 8/4 = 2 is even.
MATHEMATICA
q[n_] := Divisible[n, (d = DivisorSigma[0, n])] && EvenQ[n/d]; Select[Range[2000], q]
PROG
(PARI) isok(k) = my(q=k/numdiv(k)); (denominator(q)==1) && ((q%2) == 0); \\ Michel Marcus, Feb 20 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Amiram Eldar, Feb 19 2021
STATUS
approved