

A203814


Number of numbers <= n having as many distinct digits as n has.


1



1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 1, 11, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 13, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 14, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 15, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 16, 52, 53
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,2


LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000


EXAMPLE

a(9) = #{0, 1, 2, 3, 4, 5, 6, 7, 8, 9} = 10;
a(10) = #{10} = 1;
a(11) = #{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11} = 11;
a(12) = #{10, 12} = 2.


PROG

(Haskell)
a203814 n = length [x  x < [0..n], a043537 x == a043537 n]


CROSSREFS

Cf. A043537.
Sequence in context: A274206 A214949 A067453 * A280505 A262401 A118541
Adjacent sequences: A203811 A203812 A203813 * A203815 A203816 A203817


KEYWORD

nonn,base,look


AUTHOR

Reinhard Zumkeller, Jan 06 2012


STATUS

approved



