

A037968


Greatest number of distinct digits of n in any base b>=2.


4



1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 3, 3, 2, 3, 2, 2, 3, 2, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

a(A049363(n)) = n and a(m) < n for m < A049363(n).  Reinhard Zumkeller, Oct 27 2003
From Robert G. Wilson v, Aug 29 2014: (Start)
First occurrence of k: 1, 2, 11, 75, 694, 8345, 123717, …, . A049363
Last occurrence of k: 1, 43, 2462, 140081, 20338085, …, . A246535
Count of f(j) = k: 1, 22, 340, 8888, …, . not in the OEIS data base.
(End)


LINKS

Robert G. Wilson v, Table of n, a(n) for n = 1..1000


MATHEMATICA

f[n_] := Max@ Table[ Length@ Union@ IntegerDigits[n, b], {b, 2, n }]; f[1] = 1; Array[f, 105] (* Robert G. Wilson v, Aug 29 2014 *)


PROG

(PARI) a(n) = {nb = 1; for (k=2, n, nb = max (nb, #Set(digits(n, k))); ); nb; } \\ Michel Marcus, Sep 13 2014


CROSSREFS

See A037914 for the least corresponding bases.
Sequence in context: A083311 A104230 A226774 * A303378 A074908 A307713
Adjacent sequences: A037965 A037966 A037967 * A037969 A037970 A037971


KEYWORD

nonn,base


AUTHOR

Clark Kimberling


STATUS

approved



