|
%I #23 Aug 16 2018 13:31:09
%S 405,567,810,891,1053,1134,1377,1539,1620,1782,1863,1875,2106,2268,
%T 2349,2511,2754,2997,3078,3240,3321,3483,3564,3726,3750,3807,4212,
%U 4293,4375,4536,4698,4779,4941,5022,5427,5508,5751,5913,5994,6156,6399,6480,6642,6723,6875,6966,7128,7203,7209,7452,7500,7614,7857,8125
%N Numbers with 10 odd divisors.
%C Positive integers that have exactly 10 odd divisors.
%C Numbers n such that the symmetric representation of sigma(n) has 10 subparts. - _Omar E. Pol_, Dec 29 2016
%C Numbers that can be formed in exactly 9 ways by summing sequences of 2 or more consecutive positive integers. - _Julie Jones_, Aug 13 2018
%H Muniru A Asiru, <a href="/A267893/b267893.txt">Table of n, a(n) for n = 1..5000</a>
%F A001227(a(n)) = 10.
%t Select[Range@ 8125, Length@ Select[Divisors@ #, OddQ] == 10 &] (* _Michael De Vlieger_, Dec 30 2016 *)
%o (PARI) isok(n) = sumdiv(n, d, (d%2)) == 10; \\ after _Michel Marcus_
%o (GAP) A:=List([1..10000],n->DivisorsInt(n));; B:=List([1..Length(A)],i->Filtered(A[i],IsOddInt));;
%o a:=Filtered([1..Length(B)],i->Length(B[i])=10); # _Muniru A Asiru_, Aug 14 2018
%Y Column 10 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, A267892, this sequence.
%K nonn
%O 1,1
%A _Omar E. Pol_, Apr 03 2016
|
