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 A345467 #50 Jul 30 2021 13:24:36
%S A345467 1,37,12345679,4115226337448559670781893,
%T A345467 1371742112482853223593964334705075445816186556927297668038408779149519890260631
%N A345467 Ratios R(k)/k for which R(k) / k is an integer, where R(k) = A002275(k) is a repunit.
%C A345467 This is the sequence where fractions of repunits (A002275) and their number of digits in base 10 R(k) / k are integers, where k is A014950(n). This happens for all k of the form k=3^m; this is true because R(3k) / R(k) = 10^(2k) + 10^n*k + 1, which is divisible by 3. Therefore R(3^m) is divisible by 3^m by induction on m. There are additional solutions in A014950.
%F A345467 a(n) = A002275(A014950(n))/A014950(n).
%e A345467 For n = 2, a(2) = 111/3 = 37. For n = 3, a(3) = 111111111/9 = 12345679.
%t A345467 s = Join[{1}, Select[Range[3, 81, 6], PowerMod[10, #, #] == 1 &]]; Table[(10^n - 1)/(9*n), {n, s}] (* _Amiram Eldar_, Jun 20 2021 *)
%o A345467 (Python) [(10**n-1)//(9*n) for n in range(1, 300) if not (10**n-1)//9 % n]
%Y A345467 Cf. A002275, A014950.
%K A345467 base,nonn
%O A345467 1,2
%A A345467 _Thomas T. Burgess_, Jun 20 2021