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 A007737 #28 Aug 26 2024 04:55:29
%S A007737 1,1,1,1,1,1,2,1,1,1,10,1,12,2,1,1,16,1,9,1,2,10,11,1,5,12,1,2,14,1,6,
%T A007737 1,10,16,2,1,4,9,12,1,40,2,3,10,1,11,23,1,14,5,16,12,26,1,10,2,9,14,
%U A007737 58,1,60,6,2,1,12,10,33,16,11,2,35,1,36,4,5,9,10,12,78,1,1,40,82,2,16,3,14,10
%N A007737 Period of repeating digits of 1/n in base 6.
%C A007737 Not multiplicative. Smallest counterexample: a(77)=10, but a(7) = 2 and a(11) = 10. - _Mitch Harris_, May 16 2005.
%H A007737 T. D. Noe, <a href="/A007737/b007737.txt">Table of n, a(n) for n=1..1000</a>
%H A007737 <a href="/index/1#1overn">Index entries for sequences related to decimal expansion of 1/n</a>.
%t A007737 DigitCycleLength[r_Rational, b_Integer?Positive] := MultiplicativeOrder[b, FixedPoint[ Quotient[#, GCD[#, b]] &, Denominator[r]]]; DigitCycleLength[1, b_Integer?Positive] = 1; Array[ DigitCycleLength[1/#, 6] &, 80] (* _Robert G. Wilson v_, Jun 10 2011 *)
%t A007737 a[n_] := MultiplicativeOrder[6, n/Times @@ ({2, 3}^IntegerExponent[n, {2, 3}])]; Array[a, 100] (* _Amiram Eldar_, Aug 26 2024 *)
%o A007737 (PARI) a(n)=znorder(Mod(6, n/2^valuation(n, 2)/3^valuation(n, 3))); \\ _Joerg Arndt_, Dec 14 2014
%Y A007737 Cf. A007733 (base 2), A007734 (3), A007735 (4), A007736 (5), A007738 (7), A007739 (8), A007740 (9), A007732 (10).
%K A007737 nonn,base
%O A007737 1,7
%A A007737 _N. J. A. Sloane_, Hal Sampson (hals(AT)easynet.com)
%E A007737 More terms from _David W. Wilson_