cp's OEIS Frontend

A073531 Number of n-digit positive integers with all digits distinct.

%I A073531 #30 Feb 16 2025 08:32:46
%S A073531 9,81,648,4536,27216,136080,544320,1632960,3265920,3265920
%N A073531 Number of n-digit positive integers with all digits distinct.
%C A073531 For any base b the number of distinct-digit numbers is finite. For base 10, the maximal distinct-digit number is 9876543210; for any larger number at least two digits coincide. The number of distinct-digit primes is also finite, see A073532.
%C A073531 If "positive" is replaced by "nonnegative" we get the sequence 10, 81, 648, 4536, 27216, 136080, 544320, 1632960, 3265920, 3265920.
%C A073531 Alternatively, if 0 is considered to have 0 digits, one could prefix a(0) = 1. This would be compatible with the given formula and 9/10 rounded to the nearest integer. - _M. F. Hasler_, Dec 10 2018
%C A073531 a(10) is the final term because no number having more than 10 digits can have all digits distinct. - _Jon E. Schoenfield_, May 17 2021
%H A073531 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Digit.html">Digit</a>
%F A073531 a(n) = 9*9!/(10-n)!.
%e A073531 a(3) = 648 because there are 648 three-digit integers with distinct digits.
%p A073531 seq(9*factorial(9)/(factorial(10-n)),n=1..10); # _Muniru A Asiru_, Dec 11 2018
%t A073531 Table[9*9!/(10-n)!, {n, 10}]
%o A073531 (PARI) apply( A073531(n)=if(n<11,9*9!\/(10-n)!), [1..13]) \\ or: 9*binomial(9,10-n)*(n-1)! without need for if(). - _M. F. Hasler_, Dec 10 2018
%o A073531 (GAP) List([1..10],n->9*Factorial(9)/(Factorial(10-n))); # _Muniru A Asiru_, Dec 11 2018
%o A073531 (Magma) [9*Factorial(9)/Factorial(10-n): n in [1..10]]; // _Vincenzo Librandi_, Dec 13 2018
%Y A073531 Cf. A073532.
%Y A073531 Cf. A010784 for the list of these integers.
%K A073531 nonn,base,fini,full
%O A073531 1,1
%A A073531 _Zak Seidov_, Aug 29 2002
%E A073531 Keywords fini, full added by _Jon E. Schoenfield_, May 17 2021