This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A004285 #14 Dec 28 2015 20:53:47 %S A004285 1,11,11,1111,10,11,1001,10111,1001,110,11111,1111,101,1001,110,10111, %T A004285 101111,1001,110111,11110,1001,101011,100101,11111111,100,101,11011, %U A004285 11011,1000011,110,111,110101,1011101,111001,10010,11011,101011,111001,1111,101110,10111 %N A004285 Least positive multiple of n written in base 5 using only 0 and 1. %H A004285 Robert Israel, <a href="/A004285/b004285.txt">Table of n, a(n) for n = 1..10000</a> %p A004285 N:= 100: # to get a(1) .. a(N) %p A004285 S:= [[1,1]]: %p A004285 A[1]:= 1: %p A004285 Todo:= {$2..N}: %p A004285 count:= 1: %p A004285 for d from 2 while count < N do %p A004285 S:= map(t -> ([5*t[1],10*t[2]],[5*t[1]+1,10*t[2]+1]), S); %p A004285 for p in S do %p A004285 s:= p[1]; %p A004285 Ts:= select(t -> s mod t = 0, Todo); %p A004285 Todo:= Todo minus Ts; %p A004285 count:= count + nops(Ts); %p A004285 for m in Ts do %p A004285 A[m]:= p[2]; %p A004285 od %p A004285 od; %p A004285 od: %p A004285 seq(A[n],n=1..N); # _Robert Israel_, Dec 28 2015 %o A004285 (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 %K A004285 nonn,base %O A004285 1,2 %A A004285 _David W. Wilson_ %E A004285 a(33) corrected by _Sean A. Irvine_, Dec 26 2015 %E A004285 More terms from _Michel Marcus_, Dec 27 2015