OFFSET
1,1
COMMENTS
See A256866 for a variant where divisibility by prime(d+1) is required instead.
Since digit 0 is not allowed, no terms are divisible by 6, so digits 1 and 2 can't both be present. - Robert Israel, Apr 04 2024
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
MAPLE
P:= [2, 3, 5, 7, 11]:
filter6:= proc(n) local S, s;
S:= convert(convert(n, base, 6), set);
if member(0, S) then return false fi;
n mod mul(P[s], s=S) = 0
end proc:
S1:= {1}; S2:= {2}; S0:= {3, 4, 5}: R:= select(filter6, S0 union S1 union S2):
for i from 2 to 10 do
S1:= map(t -> (6*t+1, 6*t+3, 6*t+4, 6*t+5), S1) union map(t -> 6*t+1, S0);
S2:= map(t -> (6*t+2, 6*t+3, 6*t+4, 6*t+5), S2) union map(t -> 6*t+2, S0);
S0:= map(t -> (6*t+3, 6*t+4, 6*t+5), S0);
R:= R union select(filter6, S0) union select(filter6, S1) union select(filter6, S2);
od:
sort(convert(R, list)); # Robert Israel, Apr 04 2024
MATHEMATICA
ndpQ[n_]:=Module[{ds=Union[IntegerDigits[n, 6]]}, FreeQ[ds, 0]&&And@@ Table[ Divisible[n, Prime[i]], {i, ds}]]; Select[Range[20000], ndpQ] (* Harvey P. Dale, May 29 2015 *)
PROG
(PARI) is(n, b=6)=!for(i=1, #d=Set(digits(n, b)), (!d[i]||n%prime(d[i]))&&return)
CROSSREFS
KEYWORD
nonn,base
AUTHOR
M. F. Hasler, Apr 11 2015
EXTENSIONS
More terms from Robert Israel, Apr 04 2024
STATUS
approved