cp's OEIS Frontend

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.

A179193 Sum of the number of repeating digits for each reciprocal of integer m, where 1 < m < n and n is the base.

This page as a plain text file.
%I A179193 #13 Jun 28 2024 04:28:52
%S A179193 0,1,1,4,1,9,9,9,9,20,15,30,22,28,23,52,33,63,58,44,65,86,84,67,68,
%T A179193 102,135,140,74,142,171,159,142,124,88,220,204,205,238,258,209,244,
%U A179193 231,201,245,304,328,214,291,292,465,422,380,350,422,381,507,507,417,627
%N A179193 Sum of the number of repeating digits for each reciprocal of integer m, where 1 < m < n and n is the base.
%C A179193 No digits are counted as repeating for 1/m if 1/m terminates.
%C A179193 Equivalent to 1 <= m <= n, since 1/n and 1/1 do not have repeating digits in any integer base n.
%H A179193 Amiram Eldar, <a href="/A179193/b179193.txt">Table of n, a(n) for n = 2..10000</a>
%e A179193 7th term considers octal: the fractions 1/2, 1/3, 1/4, 1/5, 1/6 and 1/7 have 0, 2, 0, 4, 2 and 1 repeating (octal) digits respectively, for a total of 9.
%e A179193 9th term considers decimal: the fractions 1/2, 1/3, 1/4, 1/5, 1/6, 1/7, 1/8 and 1/9 have 0, 1, 0, 0, 1, 6, 0 and 1 repeating (decimal) digits respectively, for a total of 9.
%t A179193 a[n_] := Sum[Length[RealDigits[1/k, n][[1, -1]]], {k, 2, n-1}]; Array[a, 100, 2] (* _Amiram Eldar_, Jun 28 2024 *)
%Y A179193 Cf. A051626.
%K A179193 nonn,base
%O A179193 2,4
%A A179193 _Will Nicholes_, Jul 01 2010
%E A179193 Data corrected and extended by _Amiram Eldar_, Jun 28 2024