login

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”).

A057532
n is odd and sum of digits of n equals the numbers of divisors of n.
8
1, 11, 101, 225, 301, 441, 525, 1003, 1111, 1425, 1521, 1575, 1911, 2015, 2101, 2325, 2475, 2541, 2601, 2925, 3225, 3311, 3825, 4275, 4301, 4851, 5025, 5175, 5445, 5733, 5775, 6075, 6321, 6525, 7315, 7605, 7623, 8325, 8925, 9225, 9555, 10003, 10021
OFFSET
1,2
LINKS
MATHEMATICA
Select[Range[1, 10^4, 2], Plus @@ IntegerDigits[#] == DivisorSigma[0, #] &] (* Giovanni Resta, Apr 24 2017 *)
CROSSREFS
KEYWORD
nonn,easy,base
AUTHOR
Asher Auel, Sep 03 2000
STATUS
approved