Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 Oct 27 2023 22:00:46
%S 1,11,101,225,301,441,525,1003,1111,1425,1521,1575,1911,2015,2101,
%T 2325,2475,2541,2601,2925,3225,3311,3825,4275,4301,4851,5025,5175,
%U 5445,5733,5775,6075,6321,6525,7315,7605,7623,8325,8925,9225,9555,10003,10021
%N n is odd and sum of digits of n equals the numbers of divisors of n.
%H Giovanni Resta, <a href="/A057532/b057532.txt">Table of n, a(n) for n = 1..10000</a>
%t Select[Range[1, 10^4, 2], Plus @@ IntegerDigits[#] == DivisorSigma[0, #] &] (* _Giovanni Resta_, Apr 24 2017 *)
%Y Cf. A000005, A007953, A033950, A057531.
%K nonn,easy,base
%O 1,2
%A _Asher Auel_, Sep 03 2000