|
%I #17 Jul 15 2022 20:40:18
%S 4,9,12,16,18,20,24,25,28,30,32,36,40,42,44,45,48,49,50,52,54,56,60,
%T 63,66,68,70,72,75,76,78,80,81,84,88,90,92,96,98,99,100,102,104,105,
%U 108,110,112,114,116,117,120,121,124,126,128,130,132,135,136,138,140,147,148,150,152
%N Complement of A007956: numbers not of the form P(k)/k where P(n) is the product of the divisors of n.
%C There are no primes in the sequence, since A007956(p^2) = p for all primes p.
%C There are infinitely many terms, in fact p^2 is a term for all primes p.
%C If 8k+1 is not a perfect square, then p^k is a term for all primes p.
%C Depends only on the prime signature: n is in this sequence if and only if A046523(n) is in this sequence. - _Charles R Greathouse IV_, Jul 08 2022
%C Contains all the weak numbers (A052485) aside from the primes (A000040) and squarefree semiprimes (A006881). - _Charles R Greathouse IV_, Jul 08 2022
%D Wacław Sierpiński, Elementary Theory of Numbers, Ex. 2 p. 174, Warsaw, 1964.
%F a(n) = n + O(n log log n/log n). - _Charles R Greathouse IV_, Jul 08 2022
%e 4 is a term of this sequence because there are no numbers k such that A007956(k) = 4.
%e 2^10 is not a term of this sequence because A007956(32) = 1024 (Note that 8*10+1=81=9^2 is a perfect square).
%e p^4 belongs to this sequence for all primes p, in fact 8*4+1=33 is not a perfect square, so there are no numbers h such that A007956(h) = p^4.
%t Complement[Complement[Table[n, {n, 2, 1000}], Select[NumericalSort[Table[Times @@ Most[Divisors[n]], {n, 1000000}]], # != 1 && # < 1000 &]], Select[Table[Prime[n], {n, 1, 1000}], # < 1000 &]]
%Y Subsequences by prime signature: A001248 (p^2), A054753 (p^2*q), A030514 (p^4), A065036 (p^3*q), A007304 (p*q*r), A050997 (p^5), A085986 (p^2*q^2).
%Y Cf. A007956, A052485, A106543.
%K nonn
%O 1,1
%A _Luca Onnis_, Jul 07 2022
|
