The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A276810 Numbers n such that A045876(n) has distinct decimal digits. 0
 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, 89, 93, 94, 95, 96, 97, 98, 149, 158, 167, 176, 185, 194, 199, 239, 248, 257, 275, 284, 289, 293, 298, 329, 347, 356, 365, 374, 379, 388, 392, 397, 419, 428, 437, 469, 473, 478, 482 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS This sequence contains 146 elements. The largest is 991. No 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 LINKS EXAMPLE 289 is a term because 289+298+829+892+928+982 = 4218 has distinct decimal digits. MATHEMATICA Select[Range[10^3], Max@ DigitCount@ Total@ Map[FromDigits, Permutations@ IntegerDigits@ #] == 1 &] (* Michael De Vlieger, Sep 19 2016 *) PROG (PARI) A047726(n) = n=eval(Vec(Str(n))); (#n)!/prod(i=0, 9, sum(j=1, #n, n[j]==i)!); A055642(n) = #Str(n); A007953(n) = sumdigits(n); A045876(n) = ((10^A055642(n)-1)/9)*(A047726(n)*A007953(n)/A055642(n)); isA010784(n) = my(v=vecsort(digits(n))); v==vecsort(v, , 8); is(n) = isA010784(A045876(n)); CROSSREFS Cf. A010784, A045876. Sequence in context: A270393 A257787 A098771 * A024659 A342442 A342755 Adjacent sequences:  A276807 A276808 A276809 * A276811 A276812 A276813 KEYWORD nonn,base,fini AUTHOR Altug Alkan, Sep 18 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 21 17:04 EDT 2021. Contains 343156 sequences. (Running on oeis4.)