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.

A362865 a(n) is the length of the longest possible cycle of repeating digits in the digits expansion of 1/x, in base n, among all numbers x between 1 and n-1.

This page as a plain text file.
%I A362865 #29 May 12 2023 12:21:07
%S A362865 1,1,2,1,4,4,3,6,6,6,10,6,12,5,10,10,12,16,18,18,16,16,11,11,20,22,18,
%T A362865 22,28,28,22,30,14,11,28,22,36,28,18,36,30,30,16,42,40,42,23,36,23,46,
%U A362865 40,42,52,52,46,52,42,46,58,46,60,29,58,46,60,60,66,58,60
%N A362865 a(n) is the length of the longest possible cycle of repeating digits in the digits expansion of 1/x, in base n, among all numbers x between 1 and n-1.
%C A362865 This longest cycle may be attained by multiple values of x, among which x = A362840(n) is the smallest.
%e A362865 a(10)=6 since in base 10, the longest possible cycle of recurrent digits for 1/x is of length 6, which appears for 1/7 = 0.142857...
%Y A362865 Cf. A362840.
%Y A362865 Cf. A051626.
%K A362865 nonn,base
%O A362865 3,3
%A A362865 _Itamar Zamir_, May 06 2023