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

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
OFFSET
1,2
COMMENTS
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
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
Sequence in context: A270393 A257787 A098771 * A024659 A342442 A342755
KEYWORD
nonn,base,fini
AUTHOR
Altug Alkan, Sep 18 2016
EXTENSIONS
Clarified comment. - Harvey P. Dale, Apr 30 2022
STATUS
approved