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 A244960 #15 Feb 03 2024 13:32:32
%S A244960 1,10,9,820,10,90,91,5380840,9,10,7381,7380,91,66430,90,43644592,6562,
%T A244960 90,7372,820,819,65692,7291,48427560,7300,66430,81,532252,59131,90,
%U A244960 66340,48368512,66429,6562,66430,7380,532171,7372,819,5380840,82,597870,66349
%N A244960 Smallest positive multiple of n whose base 9 representation contains only 0's and 1's.
%H A244960 Harvey P. Dale, <a href="/A244960/b244960.txt">Table of n, a(n) for n = 1..1000</a>
%H A244960 Ed Pegg Jr., <a href="http://www.mathpuzzle.com/Binary.html">'Binary' Puzzle</a>
%H A244960 Eric M. Schmidt, <a href="/A004290/a004290_1.sage.txt">Sage code to compute this sequence</a> (use b=9)
%H A244960 Chai Wah Wu, <a href="http://www.jstor.org/stable/10.4169/amer.math.monthly.121.06.529">Pigeonholes and repunits</a>, Amer. Math. Monthly, 121 (2014), 529-533.
%t A244960 Module[{nn=15,b9},b9=Rest[FromDigits[#,9]&/@Tuples[{0,1},nn]];Table[SelectFirst[ b9,Mod[#,n]==0&],{n,100}]] (* _Harvey P. Dale_, Feb 03 2024 *)
%o A244960 (PARI) a(n,b=9) = if (n, k=1; while(vecmax(digits(k*n, b))>1, k++); k*n); \\ _Michel Marcus_, Jul 10 2014
%Y A244960 Cf. A004289 (written in base 9), A004290, A244954-A244959.
%K A244960 nonn,base
%O A244960 1,2
%A A244960 _Eric M. Schmidt_, Jul 09 2014
%E A244960 Data corrected, offset corrected, and b-file replaced by _Harvey P. Dale_, Feb 03 2024