|
|
A270037
|
|
a(n) = Smallest m >= 3 containing no zeros when represented in any base from 3 through n.
|
|
12
|
|
|
4, 5, 7, 7, 13, 13, 13, 13, 13, 13, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 157, 157, 157, 157, 157, 157, 157, 157, 157, 157, 157, 157, 157, 157, 157, 157, 157, 157, 157, 157, 157, 157, 157
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
3,1
|
|
COMMENTS
|
It remains to be determined if the sequence is finite.
Every known term in this sequence is in A069575, and every term in A069575 is in this sequence.
|
|
LINKS
|
|
|
MATHEMATICA
|
Table[SelectFirst[Range[3, 10^3], Total@ Map[Function[k, DigitCount[#, k, 0]], Range[3, n]] == 0 &], {n, 3, 80}] /. n_ /; MissingQ@ n -> Nothing (* Michael De Vlieger, Mar 10 2016, Version 10.2 *)
|
|
PROG
|
(PARI) isok(m, n) = {for (b=3, n, if (! vecmin(digits(m, b)), return (0)); ); 1; }
a(n) = {my(m = 3); while (! isok(m, n), m++); m; } \\ Michel Marcus, Mar 10 2016
|
|
CROSSREFS
|
Cf. A069575, A270027, A270038, A216192, A270039, A270040, A270041, A270042, A270043, A270044, A270045.
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|