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

Numbers n such that the number formed by the digits of 2n sorted in ascending order is equal to the sum of the divisors of n after the digits of each divisor have been sorted in ascending order.
0

%I #8 Dec 15 2017 17:36:19

%S 6,28,487,4204,17208,20044,20404,25741,34687,36847,41257,42004,42571,

%T 48673,51427,97398,125407,140439,140527,200404,204004,207541,250741,

%U 254071,257401,304687,304867,368047,402004,407521,410257,425071,425107

%N Numbers n such that the number formed by the digits of 2n sorted in ascending order is equal to the sum of the divisors of n after the digits of each divisor have been sorted in ascending order.

%C Primes with certain digits and various combinations of those digits along with any number of zeros inserted are members. E.g., primes of the form 425(0_z)71, or 71+17*2^n*5^(n+2) for n>1 and primes of the form 25(0_z)741 or 741+2^n*5^(n+2) for n>2 etc. are in this sequence.

%e a(4)=4204 because the digits of 2*4204 sorted ascending are 488; the divisors of 4204 are [1, 2, 4, 1051, 2102, 4204] and 1+2+4+115+122+244 = 488.

%K base,nonn

%O 1,1

%A _Jason Earls_, Jun 11 2003