OFFSET
1,2
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
MAPLE
N:= 100: # to get a(1) .. a(N)
S:= [[1, 1]]:
A[1]:= 1:
Todo:= {$2..N}:
count:= 1:
for d from 2 while count < N do
S:= map(t -> ([5*t[1], 10*t[2]], [5*t[1]+1, 10*t[2]+1]), S);
for p in S do
s:= p[1];
Ts:= select(t -> s mod t = 0, Todo);
Todo:= Todo minus Ts;
count:= count + nops(Ts);
for m in Ts do
A[m]:= p[2];
od
od;
od:
seq(A[n], n=1..N); # Robert Israel, Dec 28 2015
PROG
(PARI) a(n) = {k=1; while (vecmax(digits(k*n, 5)) != 1, k++); subst(Pol(digits(k*n, 5)), x, 10); } \\ Michel Marcus, Dec 27 2015
CROSSREFS
KEYWORD
nonn,base
AUTHOR
EXTENSIONS
a(33) corrected by Sean A. Irvine, Dec 26 2015
More terms from Michel Marcus, Dec 27 2015
STATUS
approved