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 A244958 #20 Feb 01 2024 15:32:20
%S A244958 1,8,57,8,50,19608,7,8,351,50,2409,19608,351,56,2745,400,16864,134856,
%T A244958 57,400,399,2794,17158,19608,50,19552,351,56,137257,120450,16864,2752,
%U A244958 2409,16864,350,134856,117993,19608,351,400,134849,137256,344,16808,2745
%N A244958 Smallest positive multiple of n whose base-7 representation contains only 0's and 1's.
%H A244958 Harvey P. Dale, <a href="/A244958/b244958.txt">Table of n, a(n) for n = 1..1000</a>
%H A244958 Ed Pegg Jr., <a href="http://www.mathpuzzle.com/Binary.html">'Binary' Puzzle</a>
%H A244958 Eric M. Schmidt, <a href="/A004290/a004290_1.sage.txt">Sage code to compute this sequence</a> (use b=7)
%H A244958 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 A244958 With[{cl=Rest[{FromDigits[#,7],FromDigits[#]}&/@Tuples[{0,1},7]]},Table[SelectFirst[cl,Mod[ #[[1]],n]==0&],{n,50}]][[;;,1]] (* _Harvey P. Dale_, Feb 01 2024 *)
%Y A244958 Cf. A004287 (written in base 7), A004290, A244954-A244960.
%K A244958 nonn,base
%O A244958 1,2
%A A244958 _Eric M. Schmidt_, Jul 09 2014
%E A244958 Data corrected, Offset corrected, Mathematica program corrected and replaced, and b-file replaced by _Harvey P. Dale_, Feb 01 2024