login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A344389 a(n) is the number of nonnegative numbers < 10^n with all digits distinct. 0

%I #25 Jun 15 2021 14:32:32

%S 1,10,91,739,5275,32491,168571,712891,2345851,5611771,8877691,8877691,

%T 8877691,8877691,8877691,8877691,8877691,8877691,8877691,8877691,

%U 8877691,8877691,8877691,8877691,8877691,8877691,8877691,8877691,8877691,8877691,8877691,8877691

%N a(n) is the number of nonnegative numbers < 10^n with all digits distinct.

%C a(n) = a(10) for n > 10 by the pigeonhole principle.

%F a(0) = 1; a(n) = A073531(n) + a(n-1).

%Y Cf. A073531.

%K nonn,base

%O 0,2

%A _Quan Tran_, May 16 2021

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 11 19:26 EDT 2024. Contains 374234 sequences. (Running on oeis4.)