|
%I #34 May 12 2019 15:33:43
%S 225,441,450,882,900,1089,1225,1521,1764,1800,2178,2450,2601,3025,
%T 3042,3249,3528,3600,4225,4356,4761,4900,5202,5929,6050,6084,6498,
%U 6561,7056,7200,7225,7569,8281,8450,8649,8712,9025,9522,9800,10404,11858,12100,12168,12321,12996,13122,13225,14112,14161,14400,14450,15129
%N Numbers with 9 odd divisors.
%C Positive integers that have exactly nine odd divisors.
%C Numbers n such that the symmetric representation of sigma(n) has 9 subparts. - _Omar E. Pol_, Dec 29 2016
%C From _Robert Israel_, Dec 29 2016: (Start)
%C Numbers n such that A000265(n) is in A030627.
%C Numbers of the form 2^j*p^8 or 2^j*p^2*q^2 where p and q are distinct odd primes. (End)
%C Numbers that can be formed in exactly 8 ways by summing sequences of 2 or more consecutive positive integers. - _Julie Jones_, Aug 13 2018
%H Robert Israel, <a href="/A267892/b267892.txt">Table of n, a(n) for n = 1..10000</a>
%F A001227(a(n)) = 9.
%p N:= 10^5: # to get all terms <= N
%p P:= select(isprime, [seq(i,i=3..floor(sqrt(N)/2),2)]);
%p Aodd:= select(`<=`,map(t -> t^8, P) union {seq(seq(P[i]^2*P[j]^2,i=1..j-1),j=1..nops(P))}, N):
%p A:= map(t -> seq(2^j*t,j=0..ilog2(N/t)), Aodd):
%p sort(convert(A,list)); # _Robert Israel_, Dec 29 2016
%t Select[Range[5^6], Length[Divisors@ # /. d_ /; EvenQ@ d -> Nothing] == 9 &] (* _Michael De Vlieger_, Apr 04 2016 *)
%t Select[Range[16000],Total[Boole[OddQ[Divisors[#]]]]==9&] (* _Harvey P. Dale_, May 12 2019 *)
%o (PARI) isok(n) = sumdiv(n, d, (d%2)) == 9; \\ after _Michel Marcus_.
%o (GAP) A:=List([1..16000],n->DivisorsInt(n));; B:=List([1..Length(A)],i->Filtered(A[i],IsOddInt));;
%o a:=Filtered([1..Length(B)],i->Length(B[i])=9); # _Muniru A Asiru_, Aug 14 2018
%Y Column 9 of A266531.
%Y Cf. A001227, A038547, A237593, A279387.
%Y Numbers with exactly k odd divisors (k = 1..10): A000079, A038550, A072502, apparently A131651, A267696, A230577, A267697, A267891, this sequence, A267893.
%Y Cf. A000265, A030627.
%K nonn
%O 1,1
%A _Omar E. Pol_, Apr 03 2016
|
