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.

A007736 Period of repeating digits of 1/n in base 5.

This page as a plain text file.
%I A007736 #29 Jul 10 2024 20:31:56
%S A007736 1,1,2,1,1,2,6,2,6,1,5,2,4,6,2,4,16,6,9,1,6,5,22,2,1,4,18,6,14,2,3,8,
%T A007736 10,16,6,6,36,9,4,2,20,6,42,5,6,22,46,4,42,1,16,4,52,18,5,6,18,14,29,
%U A007736 2,30,3,6,16,4,10,22,16,22,6,5,6,72,36,2,9,30,4,39,4,54,20,82,6,16,42,14,10,44
%N A007736 Period of repeating digits of 1/n in base 5.
%H A007736 T. D. Noe, <a href="/A007736/b007736.txt">Table of n, a(n) for n=1..1000</a>
%H A007736 <a href="/index/1#1overn">Index entries for sequences related to decimal expansion of 1/n</a>
%t A007736 f[n_] := MultiplicativeOrder[5, n/(5^IntegerExponent[n, 5])]; Array[f, 80] (* _Robert G. Wilson v_, Jun 10 2011 *)
%t A007736 Table[Length[RealDigits[1/n,5][[1,1]]],{n,90}]/.(0->1) (* _Harvey P. Dale_, Dec 28 2016 *)
%o A007736 (PARI) A007736(n,bas)={ local(p) ; for(sp=2,1000000, for(s=1,sp-1, p=sp-s ; if( ((bas^p-1)*bas^s) % n == 0, return(p) ; ) ; ) ; ) ; return(-1) ; } { for(n=1,100, print(n," ",A007736(n,5)) ; ) ; } \\ _R. J. Mathar_, Aug 30 2006
%o A007736 (PARI) a(n)=znorder(Mod(5,n/5^valuation(n,5))) \\ _Charles R Greathouse IV_, Jun 10 2011
%K A007736 nonn,base
%O A007736 1,3
%A A007736 _N. J. A. Sloane_, Hal Sampson (hals(AT)easynet.com), _David W. Wilson_