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 A277059 #9 Oct 08 2016 16:57:30 %S A277059 1,4,6,14,45,370,588,3364,11115,168496,271458,2442138 %N A277059 Least k such that any sufficiently long repunit multiplied by k contains all nonzero digits in base n. %C A277059 Trailing terms of rows of A277058. %C A277059 Written in base n, the terms read: 1, 11, 12, 24, 113, 1036, 1114, 4547, 11115, 105659, 111116, 67676A, ... %F A277059 Conjecture: %F A277059 for n=2m, a(n) = (n^m-1)/(n-1) + m - 1; %F A277059 for n=4m+1, a(n) = (n^(2m)-1)(n^2+1) / (2(n^2-1)) + m; %F A277059 for n=4m-1, a(n) = (n^(2m-2)-1)(n^2+1) / (2(n^2-1)) + m + n^(2m-1). %e A277059 Any binary repunit itself contains a 1, so a(2)=1. %e A277059 k-th decimal repunit for k>4 multiplied by 11115 contains all nonzero decimal digits (see A277057) with no number less than 11115 having the same property, so a(10)=11115. %Y A277059 Cf. A002275, A277056, A277057, A277058. %K A277059 nonn,base,more %O A277059 2,2 %A A277059 _Andrey Zabolotskiy_ and _Altug Alkan_, Sep 26 2016