OFFSET
1,2
LINKS
Chai Wah Wu, Table of n, a(n) for n = 0..10000
MAPLE
f:= proc(n) local R, S, m, p, Snew, s;
R[1]:= 1; R[0]:= 0; S:= {0, 1};
for m from 1 do
p:= 8^m mod n;
Snew:= map(s -> s + p mod n, S);
if member(0, Snew) then return R[-p mod n]+10^m fi;
for s in Snew minus S do R[s] := R[s - p mod n] + 10^m od;
S:= S union Snew;
od
end proc:
1, seq(f(n), n=2..100); # Robert Israel, Dec 30 2014
PROG
(Python)
def A004288(n):
if n > 0:
for i in range(1, 2**n):
s = bin(i)[2:]
if not int(s, 8) % n:
return int(s)
return 0 # Chai Wah Wu, Dec 30 2014
CROSSREFS
KEYWORD
nonn,base
AUTHOR
EXTENSIONS
a(11), a(22), a(25) corrected by Chai Wah Wu, Dec 30 2014
Initial 0 deleted and offset corrected by N. J. A. Sloane, Jan 31 2024
STATUS
approved