|
|
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
|
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
|
|
|
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.
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|