|
%I #46 Sep 26 2019 21:14:04
%S 15015,19635,21945,23205,25935,26565,31395,33495,33915,35805,39585,
%T 41055,42315,42735,45885,47355,49665,50505,51765,54285,55965,58695,
%U 61215,64155,68145,70455,72345,77385,80535,82005,83265,84315,91245,95865,102795,112035,116655,118965
%N Primitive, odd, squarefree abundant numbers.
%C The subsequence of primitive terms (not multiples of smaller terms) of A112643.
%C The subsequence of squarefree terms of A006038.
%C The subsequence of odd terms of A249242.
%C Not the same as A129485. Does not contain, for example, 195195, 255255, 285285, 333795, 345345, 373065, which are in A129485. - _R. J. Mathar_, Nov 09 2014
%C Sequences A287590, A188342 and A287581 list the number, smallest* and largest of all squarefree odd primitive abundant numbers with n prime factors. (*At least whenever A188342(n) is squarefree, which appears to be the case for all n >= 5.) - _M. F. Hasler_, May 29 2017
%H Giovanni Resta, <a href="/A249263/b249263.txt">Table of n, a(n) for n = 1..10000</a>
%p # see A112643 and A006038 for the coding of isA112643 and isA006038
%p isA249263 := proc(n)
%p isA112643(n) and isA006038(n) ;
%p end proc:
%p for n from 1 do
%p if isA249263(n) then
%p print(n);
%p end if;
%p end do: # _R. J. Mathar_, Nov 10 2014
%t PrimAbunQ[n_] := Module[{x, y},
%t y = Most[Divisors[n]]; x = DivisorSigma[1, y];
%t DivisorSigma[1, n] > 2 n && AllTrue[x/y, # <= 2 &]];
%t Select[Range[1, 120000, 2], PrimAbunQ[#] &&
%t AllTrue[FactorInteger[#][[All, 2]], # == 1 &] &] (* _Robert Price_, Sep 26 2019 *)
%o (PARI) v=[]; for(k=1, 10^5, n=2*k+1; if(issquarefree(n) && sigma(n)>2*n, for(i=1, #v, n%v[i] || next(2)); print1(n, ", "); v=concat(v, n))) \\ Improved (from 20 sec to 0.2 sec) by _M. F. Hasler_, May 27 2017
%Y Intersection of A112643 and A006038.
%Y Cf. A249242, A129485.
%Y Cf. A188342 (least with n factors), A287581 (largest with n factors), A287590 (number of terms with n factors).
%K nonn
%O 1,1
%A _Derek Orr_, Oct 23 2014
|
