cp's OEIS Frontend

A276810 Numbers n such that A045876(n) has distinct decimal digits.

%I A276810 #15 Apr 30 2022 11:08:00
%S A276810 1,2,3,4,5,6,7,8,9,39,48,49,57,58,59,67,68,69,75,76,78,79,84,85,86,87,
%T A276810 89,93,94,95,96,97,98,149,158,167,176,185,194,199,239,248,257,275,284,
%U A276810 289,293,298,329,347,356,365,374,379,388,392,397,419,428,437,469,473,478,482
%N A276810 Numbers n such that A045876(n) has distinct decimal digits.
%C A276810 This sequence contains 146 elements. The largest is 991. No more terms below 10^10. As A045876(n) >= n, for all n >= 10^10, A045876(n) will have at least one digit not distinct. - _David A. Corneth_, Sep 19 2016
%e A276810 289 is a term because 289+298+829+892+928+982 = 4218 has distinct decimal digits.
%t A276810 Select[Range[10^3], Max@ DigitCount@ Total@ Map[FromDigits, Permutations@ IntegerDigits@ #] == 1 &] (* _Michael De Vlieger_, Sep 19 2016 *)
%o A276810 (PARI) A047726(n) = n=eval(Vec(Str(n))); (#n)!/prod(i=0, 9, sum(j=1, #n, n[j]==i)!);
%o A276810 A055642(n) = #Str(n);
%o A276810 A007953(n) = sumdigits(n);
%o A276810 A045876(n) = ((10^A055642(n)-1)/9)*(A047726(n)*A007953(n)/A055642(n));
%o A276810 isA010784(n) = my(v=vecsort(digits(n))); v==vecsort(v, , 8);
%o A276810 is(n) = isA010784(A045876(n));
%Y A276810 Cf. A010784, A045876.
%K A276810 nonn,base,fini
%O A276810 1,2
%A A276810 _Altug Alkan_, Sep 18 2016
%E A276810 Clarified comment. - _Harvey P. Dale_, Apr 30 2022