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 A244957 #15 Feb 03 2024 13:13:03
%S A244957 1,6,6,36,1555,6,7,216,36,9330,253,36,1339,42,9330,1296,1513,36,7999,
%T A244957 55980,42,1518,253,216,9325,8034,216,252,47995,9330,217,7776,1518,
%U A244957 9078,12093235,36,37,47994,8034,335880,46699,42,43,9108,55980,1518,48175,1296
%N A244957 Smallest positive multiple of n whose base-6 representation contains only 0's and 1's.
%H A244957 Eric M. Schmidt, <a href="/A244957/b244957.txt">Table of n, a(n) for n = 0..1000</a>
%H A244957 Ed Pegg Jr., <a href="http://www.mathpuzzle.com/Binary.html">'Binary' Puzzle</a>
%H A244957 Eric M. Schmidt, <a href="/A004290/a004290_1.sage.txt">Sage code to compute this sequence</a> (use b=6)
%H A244957 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 A244957 Module[{nn=10,b6},b6=Rest[FromDigits[#,6]&/@Tuples[{0,1},nn]];Table[SelectFirst[ b6,Mod[#,n]==0&],{n,100}]] (* _Harvey P. Dale_, Feb 03 2024 *)
%Y A244957 Cf. A004286 (written in base 6), A004290, A244954-A244960.
%K A244957 nonn,base
%O A244957 1,2
%A A244957 _Eric M. Schmidt_, Jul 09 2014
%E A244957 Data corrrected, offset corrected, and b-file replaced by _Harvey P. Dale_, Feb 03 2024