A001913 -id:A001913 - cp's OEIS frontend

A086018 Number of cyclic numbers (A001913) <= 10^n.

0, 1, 9, 60, 467, 3617, 29500, 248881, 2155288, 19016617, 170169241, 1539964486, 14063663530, 129413160100

Offset: 0

Eric W. Weisstein, Jul 07 2003

Note that there are several different definitions of cyclic number: this sequence refers to A001913.

			a(1)=1 since 7 is the only cyclic number <= 10^1.
a(2)=9 since the following are the cyclic numbers <= 10^2: 7, 17, 19, 23, 29, 47, 59, 61, 97.

Eric Weisstein's World of Mathematics, Cyclic Number
Eric Weisstein's World of Mathematics, Full Reptend Prime

Cf. A001913, A040402.

DigitCycleLength[ r_Rational, b_Integer?Positive ] := MultiplicativeOrder[ b, FixedPoint[ Quotient[ #, GCD[ #, b ] ] &, Denominator[ r ] ] ]; a = 0; Do[ If[ Prime[ n ] - DigitCycleLength[ 1/Prime[ n ], 10 ] == 1, a++ ], {n, 2, PrimePi[ 10^7 ]} ] Print[ a ]

Conjectured ratio a(n)/A006880(n) as n->infinity is Artin's constant 0.3739558136...

Extended by Farideh Firoozbakht, Jud McCranie, Ed Pegg Jr and Eric W. Weisstein, Aug 29 2003

a(11)-a(13) from Hiroaki Yamanouchi, Oct 10 2015

A243096 Lesser of twin primes (A001359) such that both are full reptend primes (A001913).

Original entry on oeis.org

17, 59, 179, 821, 1019, 1301, 1619, 2141, 2339, 3257, 3299, 3461, 4217, 4259, 4337, 4421, 5417, 5501, 5657, 5741, 6659, 6701, 7457, 8819, 8861, 9341, 10139, 10457, 10859, 10937, 11057, 11699, 11939, 12377, 12821, 13337, 13901, 15137, 15581, 15737, 16979, 17417, 17579, 18059, 19139, 19541, 19697

Offset: 1

Robert G. Wilson v, Aug 18 2014

A proper subset of both A001359 and A001913.

Number of terms < 10^k: 0, 2, 4, 26, 152, 1015, 7618, 56282, 436385, …, .

Robert G. Wilson v, Table of n, a(n) for n = 1..10000

Cf. A001359 & A001913.

Select[ Prime@ Range@ 2300, MultiplicativeOrder[10, #] == # - 1 && MultiplicativeOrder[10, # + 2] == # + 1 &]
Select[Partition[Prime[Range[2500]],2,1],#[[2]]-#[[1]]==2&& PrimitiveRoot[ #,10]=={10,10}&][[All,1]] (* Harvey P. Dale, Dec 02 2017 *)

Intersection of A001359 and A001913.

A186640 Primes p such that the decimal expansion of 1/p has a periodic part of even length, but are not cyclic numbers (A001913).

Original entry on oeis.org

11, 13, 73, 89, 101, 103, 127, 137, 139, 157, 197, 211, 241, 251, 281, 293, 331, 349, 353, 373, 401, 409, 421, 449, 457, 463, 521, 557, 569, 601, 607, 617, 641, 653, 661, 673, 677, 691, 739, 761, 769, 809, 829, 859, 877, 881, 929, 967, 997, 1009, 1049, 1061

Offset: 1

Jani Melik, Feb 24 2011

T. D. Noe, Table of n, a(n) for n = 1..1000

Cf. A028416.

f1_d := proc(n) local st, period:
st := ithprime(n):
period := numtheory[order](10,st):
if (modp(period,2) = 0) then
   if (st-1 <> period) then
      RETURN(st):
   fi:
fi: end:  seq(f1_d(n), n=1..200);

Select[Prime[Range[200]], EvenQ[Length[RealDigits[1/#][[1, 1]]]] && MultiplicativeOrder[10, #] != # - 1 &] (* T. D. Noe, Oct 01 2012 *)

is(p)=if(p>9 && isprime(p), my(o=znorder(Mod(10, p))); o%2==0 && o+1!=p, 0) \\ Charles R Greathouse IV, Oct 01 2012

p in A028416, but not A001913.

A186641 Primes that are not cyclic numbers (A001913).

Original entry on oeis.org

2, 3, 5, 11, 13, 31, 37, 41, 43, 53, 67, 71, 73, 79, 83, 89, 101, 103, 107, 127, 137, 139, 151, 157, 163, 173, 191, 197, 199, 211, 227, 239, 241, 251, 271, 277, 281, 283, 293, 307, 311, 317, 331, 347, 349, 353, 359, 373, 397, 401, 409, 421, 431, 439, 443, 449, 457, 463, 467, 479

Offset: 1

Jani Melik, Feb 24 2011

nonn

Sequence A006559 with 2 and 5 included.

f1 := proc(n) local st, period:
st := ithprime(n):
period := numtheory[order](10,st):
if (st-1 <> period) then
   RETURN(st):
fi: end:  seq(f1(n), n=1..150);

from itertools import islice
from sympy import nextprime, n_order
def A186641_gen(startvalue=1): # generator of terms >= startvalue
    p = max(startvalue-1,1)
    while (p:=nextprime(p)):
        if p==2 or p==5 or n_order(10,p)A186641_list = list(islice(A186641_gen(),20)) # Chai Wah Wu, Mar 03 2025

A098937 Number of cyclic numbers, primes with primitive root 10, (A001913) in the first 10^n primes (A000040).

Original entry on oeis.org

5, 38, 387, 3755, 37523, 374126, 3740610, 37393725, 373953691, 3739544360

Offset: 1

Robert G. Wilson v, Oct 19 2004

Cf. A001913, A006883, A000040, A005596.

f[n_Integer] := Block[{ds = Divisors[n - 1]}, (n - 1)/Take[ds, Position[ PowerMod[10, ds, n], 1][[1, 1]]][[ -1]]]; c = 0; k = 4; Do[ While[k <= 10^n, a = f[ Prime[k]]; If[a == 1, c++ ]; k++ ]; Print[c], {n, 7}]

Lim_{n->oo} a(n)/10^n = Artin's constant (A005596).

a(8)-a(10) from Amiram Eldar, Jul 04 2021

A001122 Primes with primitive root 2.

Original entry on oeis.org

3, 5, 11, 13, 19, 29, 37, 53, 59, 61, 67, 83, 101, 107, 131, 139, 149, 163, 173, 179, 181, 197, 211, 227, 269, 293, 317, 347, 349, 373, 379, 389, 419, 421, 443, 461, 467, 491, 509, 523, 541, 547, 557, 563, 587, 613, 619, 653, 659, 661, 677, 701, 709, 757, 773, 787, 797

Offset: 1

N. J. A. Sloane

Artin conjectured that this sequence is infinite.
Conjecture: sequence contains infinitely many pairs of twin primes. - Benoit Cloitre, May 08 2003
Pieter Moree writes (Oct 20 2004): Assuming the Generalized Riemann Hypothesis, it can be shown that the density of primes p such that a prescribed integer g has order (p-1)/t, with t fixed, exists and, moreover, it can be computed. This density will be a rational number times the so-called Artin constant. For 2 and 10 the density of primitive roots is A, the Artin constant itself.
It seems that this sequence consists of A050229 \ {1,2}.
Primes p such that 1/p, when written in base 2, has period p-1, which is the greatest period possible for any integer.
Positive integer 2*m-1 is in the sequence iff A179382(m)=m-1. - Vladimir Shevelev, Jul 14 2010
These are the odd primes p for which the polynomial 1+x+x^2+...+x^(p-1) is irreducible over GF(2). - V. Raman, Sep 17 2012 [Corrected by N. J. A. Sloane, Oct 17 2012]
Prime(n) is in the sequence if (and conjecturally only if) A133954(n) = prime(n). - Vladimir Shevelev, Aug 30 2013
Pollack shows that, on the GRH, that there is some C such that a(n+1) - a(n) < C infinitely often (in fact, 1 can be replaced by any positive integer). Further, for any m, a(n), a(n+1), ..., a(n+m) are consecutive primes infinitely often. - Charles R Greathouse IV, Jan 05 2015
From Jianing Song, Apr 27 2019: (Start)
All terms are congruent to 3 or 5 modulo 8. If we define
  Pi(N,b) = # {p prime, p <= N, p == b (mod 8)};
     Q(N) = # {p prime, p <= N, p in this sequence},
then by Artin's conjecture, Q(N) ~ C*N/log(N) ~ 2*C*(Pi(N,3) + Pi(N,5)), where C = A005596 is Artin's constant.
Conjecture: if we further define
   Q(N,b) = # {p prime, p <= N, p == b (mod 8), p in this sequence},
then we have:
   Q(N,3) ~ (1/2)*Q(N) ~ C*Pi(N,3);
   Q(N,5) ~ (1/2)*Q(N) ~ C*Pi(N,5). (End)
Conjecture: for a prime p > 5, p has primitive root 2 iff p == +-3 (mod 8) divides 2^k + 3 for some k < p - 1 and divides 2^m + 5 for some m < p - 1. It seems that all primes of the form 2^k + 3 for k <> 2 (A057732) have primitive root 2. - Thomas Ordowski, Nov 27 2023

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 864.
E. Bach and Jeffrey Shallit, Algorithmic Number Theory, I; see p. 221.
J. H. Conway and R. K. Guy, The Book of Numbers, Copernicus Press, New York, 1996; see p. 169.
M. Kraitchik, Recherches sur la Théorie des Nombres. Gauthiers-Villars, Paris, Vol. 1, 1924, Vol. 2, 1929, see Vol. 1, p. 56.
Lehmer, D. H. and Lehmer, Emma; Heuristics, anyone? in Studies in mathematical analysis and related topics, pp. 202-210, Stanford Univ. Press, Stanford, Calif., 1962.
Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. See p. 20.
D. Shanks, Solved and Unsolved Problems in Number Theory, 2nd. ed., Chelsea, 1978, p. 81.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Antti Karttunen, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Joerg Arndt, Matters Computational (The Fxtbook), pp. 876-878.
Richard Bartels, Generalized Loewy Length of Cohen-Macaulay Local and Graded Rings, arXiv:2308.14932 [math.AC], 2023. See p. 10.
J. Conde, M. Miller, J. M. Miret, and K. Saurav, On the Nonexistence of Almost Moore Digraphs of Degree Four and Five, Mathematics in Computer Science, 9(2) (2015), 145-149.
Jonathan Detchart and Jérôme Lacan, Improving the coding speed of erasure codes with polynomial ring transforms, arXiv:1709.00178 [cs.IT], 2017.
K. Dilcher and L. Ericksen, Reducibility and irreducibility of Stern (0, 1)-polynomials, Communications in Mathematics, 22 (2014), 77-102.
Gabriele Fici and Estéban Gabory, Generalized De Bruijn Words, Invertible Necklaces, and the Burrows-Wheeler Transform, arXiv:2502.12844 [math.CO], 2025. See p. 12.
R. Gupta and M. R. Murty, A remark on Artin's conjecture, Invent. Math. 78 (1984), 127-230.
C. Hooley, On Artin's conjecture, J. Reine Angewandte Math., 225 (1967), 209-220.
Florian Ingels, Anaïs Denis, and Bastien Cazaux, Decomposing Words for Enhanced Compression: Exploring the Number of Runs in the Extended Burrows-Wheeler Transform, arXiv:2506.04926 [cs.DS], 2025. See p. 15.
Robert Jackson, Dmitriy Rumynin and Oleg V. Zaboronski, An approach to RAID-6 based on cyclic groups, Applied Mathematics & Information Sciences, 5(2) (2011), 148-170.
Jonas Kaiser, On the relationship between the Collatz conjecture and Mersenne prime numbers, arXiv:1608.00862 [math.GM], 2016.
Sihem Mesnager and Jean-Pierre Flori, A note on hyper-bent functions via Dillon-like exponents, IACR, Report 2012/033, 2012.
F. Pillichshammer, Bounds for the quality parameter of digital shift nets over Z_2, Finite Fields Applic., 8 (2002), 444-454.
Pieter Moree, Artin's primitive root conjecture-a survey, arXiv:math/0412262 [math.NT], 2004-2012.
Paul Pollack, Bounded gaps between primes with a given primitive root, arXiv:1404.4007 [math.NT], 2014.
Vladimir Shevelev, On the Newman sum over multiples of a prime with a primitive or semiprimitive root 2, arXiv:0710.1354 [math.NT], 2007.
Stephan Tornier, Groups Acting on Trees With Prescribed Local Action, arXiv:2002.09876 [math.GR], 2020.
Qifu Tyler Sun, Hanqi Tang, Zongpeng Li, Xiaolong Yang, and Keping Long, Circular-shift Linear Network Codes with Arbitrary Odd Block Lengths, arXiv:1806.04635 [cs.IT], 2018.
Eric Weisstein's World of Mathematics, Artin's constant.
Wikipedia, Artin's conjecture on primitive roots.
Index entries for sequences related to Artin's conjecture
Index entries for primes by primitive root

Cf. A001123, A001913, A001917, A005596 (Artin's constant), A050229, A071642, A127209, A163782, A292270.
Cf. A002326 for the multiplicative order of 2 mod 2n+1. (Alternatively, the least positive value of m such that 2n+1 divides 2^m-1).
Cf. A216838 (Odd primes for which 2 is not a primitive root).

Select[ Prime@Range@200, PrimitiveRoot@# == 2 &] (* Robert G. Wilson v, May 11 2001 *)
pr = 2; Select[Prime[Range[200]], MultiplicativeOrder[pr, # ] == # - 1 &] (* N. J. A. Sloane, Jun 01 2010 *)

forprime(p=3, 1000, if(znorder(Mod(2, p))==(p-1), print1(p,", "))); \\ [corrected by Michel Marcus, Oct 08 2014]

from itertools import islice
from sympy import nextprime, is_primitive_root
def A001122_gen(): # generator of terms
    p = 2
    while (p:=nextprime(p)):
        if is_primitive_root(2,p):
            yield p
A001122_list = list(islice(A001122_gen(),30)) # Chai Wah Wu, Feb 13 2023

Delta(a(n),2^a(n)*x) = a(n)*Delta(a(n),2*x), where Delta(k,x) is the difference between numbers of evil(A001969) and odious(A000069) integers divisible by k in interval [0,x). - Vladimir Shevelev, Aug 30 2013

For n >= 2, a(n) = 1 + 2*A163782(n-1). - Antti Karttunen, Oct 07 2017

A005596 Decimal expansion of Artin's constant Product_{p=prime} (1-1/(p^2-p)).

Original entry on oeis.org

3, 7, 3, 9, 5, 5, 8, 1, 3, 6, 1, 9, 2, 0, 2, 2, 8, 8, 0, 5, 4, 7, 2, 8, 0, 5, 4, 3, 4, 6, 4, 1, 6, 4, 1, 5, 1, 1, 1, 6, 2, 9, 2, 4, 8, 6, 0, 6, 1, 5, 0, 0, 4, 2, 0, 9, 4, 7, 4, 2, 8, 0, 2, 4, 1, 7, 3, 5, 0, 1, 8, 2, 0, 4, 0, 0, 2, 8, 0, 8, 2, 3, 4, 4, 3, 0, 4, 3, 1, 7, 0, 8, 7, 2, 5, 0, 5, 6, 8, 9, 8, 1, 6, 0, 3

Offset: 0

N. J. A. Sloane

On Simon Plouffe's web page (and in the book freely available at Gutenberg project) the value is given with an error of +1e-31, as "...651641..." instead of "...641641...". In the reference [Wrench, 1961] cited there, these digits are correct. They are also correct on the Plouffe's Inverter page, as computed by Oliveira e Silva, who comments it took 1 hour at 200 MHz with Mathematica. Using Amiram Eldar's PARI program, the same 500 digits are computed instantly (less than 0.1 sec). - M. F. Hasler, Apr 20 2021

Named after the Austrian mathematician Emil Artin (1898-1962). - Amiram Eldar, Jun 20 2021

			0.37395581361920228805472805434641641511162924860615...

Henri Cohen, Number Theory, Volume II: Analytic and Modern Tools, GTM Vol. 240, Springer, 2007; see pp. 208-209.
John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See p. 169.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Harry J. Smith, Table of n, a(n) for n = 0..1000
Ivan Cherednik, A note on Artin's constant, arXiv:0810.2325 [math.NT], 2008.
Henri Cohen, High-precision computation of Hardy-Littlewood constants, (1998).
Henri Cohen, High-precision computation of Hardy-Littlewood constants. [pdf copy, with permission]
Steven R. Finch, Mathematical Constants II, Encyclopedia of Mathematics and Its Applications, Cambridge University Press, Cambridge, 2018, p. 156 (constant C7).
R. J. Mathar, Hardy-Littlewood constants embedded into infinite products over all positive integers, arXiv:0903.2514 [math.NT], 2009-2001; constant A_1^(1).
Pieter Moree, Artin's primitive root conjecture - a survey, arXiv:math/0412262 [math.NT], 2004-2012.
Pieter Moree, The formal series Witt transform, Discr. Math., Vol. 295, No. 1-3 (2005), pp. 143-160. See p. 159.
G. Niklasch, Some number theoretical constants: 1000-digit values. [Cached copy]
G. Niklasch, Artin's constant.
Simon Plouffe, The Artin's Constant=product(1-1/(p**2-p), p=prime) [backup on web.archive.org; chapter 8 of the free Gutenberg.org/ebooks/634]. [Warning: the value given in this reference is incorrect, cf. comment!]
Tomás Oliveira e Silva and Plouffe's Inverter, The first 500 digits of Artin's constant.
Eric Weisstein's World of Mathematics, Artin's constant.
Eric Weisstein's World of Mathematics, Full Reptend Prime.
R. G. Wilson v, Letter to N. J. A. Sloane, Aug. 1993.
John W. Wrench, Jr., Evaluation of Artin's constant and the twin-prime constant, Math. Comp., Vol. 15, No. 76 (1961), pp. 396-398.
Index entries for sequences related to Artin's conjecture.

Cf. A048296, A065414, A001913, A001122.

a = Exp[-NSum[ (LucasL[n] - 1)/n PrimeZetaP[n], {n, 2, Infinity}, PrecisionGoal -> 500, WorkingPrecision -> 500, NSumTerms -> 100000]]; RealDigits[a, 10, 111][[1]] (* Robert G. Wilson v, Sep 03 2014 taken from Mathematica's Help file on PrimeZetaP *)

prodinf(n=2,1/zeta(n)^(sumdiv(n, d, moebius(n/d)*(fibonacci(d-1)+fibonacci(d+1)))/n)) \\ Charles R Greathouse IV, Aug 27 2014

prodeulerrat(1-1/(p^2-p)) \\ Amiram Eldar, Mar 12 2021

Equals Product_{j>=2} 1/Zeta(j)^A006206(j), where Zeta = A013661, A002117 etc. is Riemann's zeta function. - R. J. Mathar, Feb 14 2009
Equals Sum_{k>=1} mu(k)/(k*phi(k)), where mu is the Moebius function (A008683) and phi is the Euler totient function (A000010). - Amiram Eldar, Mar 11 2020
Equals 1/A065488. - Vaclav Kotesovec, Jul 17 2021

More terms from Tomás Oliveira e Silva (http://www.ieeta.pt/~tos)

A002371 Period of decimal expansion of 1/(n-th prime) (0 by convention for the primes 2 and 5).

Original entry on oeis.org

0, 1, 0, 6, 2, 6, 16, 18, 22, 28, 15, 3, 5, 21, 46, 13, 58, 60, 33, 35, 8, 13, 41, 44, 96, 4, 34, 53, 108, 112, 42, 130, 8, 46, 148, 75, 78, 81, 166, 43, 178, 180, 95, 192, 98, 99, 30, 222, 113, 228, 232, 7, 30, 50, 256, 262, 268, 5, 69, 28, 141, 146, 153, 155, 312, 79, 110

Offset: 1

N. J. A. Sloane

a(n) is the minimum solution x of modular equation 10^x == 1 (mod p), where p = prime(n). - Carmine Suriano, Oct 10 2012
a(n) = smallest m such that 111...11 (m 1's) is divisible by the n-th prime, or 0 if no such m exists (with the exception that a(2) = 3 instead of 1). E.g., the 5th prime, 11, divides 11, so a(5) = 2. - N. J. A. Sloane, Oct 03 2013 [Comment corrected by Derek Orr, Jun 14 2014]
Numbers n such that A071126(n) = A000040(n) - 1. - Hugo Pfoertner, Mar 18 2003
Except for n = 1 and 3, a(n) divides A006093(n). - Robert Israel, Jul 15 2016

			A002371(11) = 15 because the 11th prime is 31, and 1/31 = 0.03225806451612903225806451612903225806452... has period 15. - _Richard F. Lyon_, Mar 29 2022

Albert H. Beiler, Recreations in the Theory of Numbers, 2nd ed. New York: Dover, 1966, pages 65, 309. ISBN 0-486-21096-0.
John H. Conway and R. K. Guy, The Book of Numbers, Copernicus Press, 1996, p. 162. ISBN 978-0-387-97993-9.
D. H. Lehmer, Guide to Tables in the Theory of Numbers. Bulletin No. 105, National Research Council, Washington, DC, 1941, p. 15.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Alois P. Heinz, Table of n, a(n) for n = 1..20000 (first 1000 terms from T. D. Noe)
C. K. Caldwell, The Prime Glossary, Period of a prime
Matt Parker and Brady Haran, The Reciprocals of Primes, Numberphile video (2022).
William Shanks, On the number of figures in the period of the reciprocal of every prime number below 20,000, Proc. Royal Soc. London, 22 (1874), 200-210. See also on JSTOR.
Eric Weisstein's World of Mathematics, Decimal Expansion
Index entries for sequences related to decimal expansion of 1/n

See A048595 for another version. Cf. A006883, A007732, A051626, A071126, A000040, A002275, A097443.
Cf. A001913 (full repetend primes), A060257 (1/prime(n) has period prime(n) - 1).
In other bases: A014664, A062117, A211241, A211242, A211243, A211244, A211245, A002371.

seq(subs(FAIL=0,numtheory:-order(10, ithprime(n))),n=1..100); # Robert Israel, Jul 15 2016

Table[ Length[ RealDigits[1 / Prime[n]] [[1, 1]]], {n, 1, 70}]
Table[If[IntegerQ[#], #, 0] &[MultiplicativeOrder[10, Prime[n]]], {n, 1, 70}] (* Jan Mangaldan, Jul 07 2020 *)

a(n)=if(n<4,n==2,znorder(Mod(10, prime(n))))

from sympy import prime, n_order
def A002371(n): return 0 if n == 1 or n == 3 else n_order(10,prime(n)) # Chai Wah Wu, Feb 07 2022

From Alexander Adamchuk, Jan 28 2007: (Start)
a(A000720(p)) = p - 1 for primes p in A001913.
a(A060257(n)) = prime(A060257(n)) - 1. (End)

More terms from Arlin Anderson (starship1(AT)gmail.com)

Edited by Charles R Greathouse IV, Mar 24 2010

A007732 Period of decimal representation of 1/n.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 2, 1, 6, 6, 1, 1, 16, 1, 18, 1, 6, 2, 22, 1, 1, 6, 3, 6, 28, 1, 15, 1, 2, 16, 6, 1, 3, 18, 6, 1, 5, 6, 21, 2, 1, 22, 46, 1, 42, 1, 16, 6, 13, 3, 2, 6, 18, 28, 58, 1, 60, 15, 6, 1, 6, 2, 33, 16, 22, 6, 35, 1, 8, 3, 1, 18, 6, 6, 13, 1, 9, 5, 41, 6, 16, 21, 28, 2, 44, 1

Offset: 1

N. J. A. Sloane, Hal Sampson [ hals(AT)easynet.com ]

Appears to be a divisor of A007733*A007736. - Henry Bottomley, Dec 20 2001
Primes p such that a(p) = p-1 are in A001913. - Dmitry Kamenetsky, Nov 13 2008
When 1/n has a finite decimal expansion (namely, when n = 2^a*5^b), a(n) = 1 while A051626(n) = 0. - M. F. Hasler, Dec 14 2015
a(n.n) >= a(n) where n.n is A020338(n). - Davide Rotondo, Jun 13 2024

J. H. Conway and R. K. Guy, The Book of Numbers, Copernicus Press, NY, 1996, pp. 159 etc.

Jon E. Schoenfield, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)
Project Euler, Reciprocal cycles: Problem 26
Index entries for sequences related to decimal expansion of 1/n

Cf. A121341, A066799, A121090, A001913, A084680.

A007732 := proc(n)
    a132740 := 1 ;
    for pe in ifactors(n)[2] do
        if not op(1,pe) in {2,5} then
            a132740 := a132740*op(1,pe)^op(2,pe) ;
        end if;
    end do:
    if a132740 = 1 then
        1 ;
    else
        numtheory[order](10,a132740) ;
    end if;
end proc:
seq(A007732(n),n=1..50) ; # R. J. Mathar, May 05 2023

Table[r = n/2^IntegerExponent[n, 2]/5^IntegerExponent[n, 5]; MultiplicativeOrder[10, r], {n, 100}] (* T. D. Noe, Oct 17 2012 *)

a(n)=znorder(Mod(10,n/2^valuation(n,2)/5^valuation(n,5))) \\ Charles R Greathouse IV, Jan 14 2013

from sympy import n_order, multiplicity
def A007732(n): return n_order(10,n//2**multiplicity(2,n)//5**multiplicity(5,n)) # Chai Wah Wu, Feb 07 2022

def a(n):
    n = ZZ(n)
    rad = 2**n.valuation(2) * 5**n.valuation(5)
    return Zmod(n // rad)(10).multiplicative_order()
[a(n) for n in range(1, 20)]
# F. Chapoton, May 03 2020

Note that if n=r*s where r is a power of 2 and s is odd then a(n)=a(s). Also if n=r*s where r is a power of 5 and s is not divisible by 5 then a(n) = a(s). So we just need a(n) for n not divisible by 2 or 5. This is the smallest number m such that n divides 10^m - 1; m is a divisor of phi(n), where phi = A000010.
phi(n) = n-1 only if n is prime and since a(n) divides phi(n), a(n) can only equal n-1 if n is prime. - Scott Hemphill (hemphill(AT)alumni.caltech.edu), Nov 23 2006
a(n)=a(A132740(n)); a(A132741(n))=a(A003592(n))=1. - Reinhard Zumkeller, Aug 27 2007

More terms from James Sellers, Feb 05 2000

A051626 Period of decimal representation of 1/n, or 0 if 1/n terminates.

Original entry on oeis.org

0, 0, 1, 0, 0, 1, 6, 0, 1, 0, 2, 1, 6, 6, 1, 0, 16, 1, 18, 0, 6, 2, 22, 1, 0, 6, 3, 6, 28, 1, 15, 0, 2, 16, 6, 1, 3, 18, 6, 0, 5, 6, 21, 2, 1, 22, 46, 1, 42, 0, 16, 6, 13, 3, 2, 6, 18, 28, 58, 1, 60, 15, 6, 0, 6, 2, 33, 16, 22, 6, 35, 1, 8, 3, 1, 18, 6, 6, 13, 0, 9, 5, 41, 6, 16, 21, 28, 2, 44, 1

Offset: 1

J. Lowell

Essentially same as A007732.

For any prime number p: if a(p) > 0, a(p) divides p-1. - David Spitzer, Jan 09 2017

			From _M. F. Hasler_, Dec 14 2015: (Start)
a(1) = a(2) = 0 because 1/1 = 1 and 1/2 = 0.5 have a finite decimal expansion.
a(3) = a(6) = a(9) = a(12) = 1 because 1/3 = 0.{3}*, 1/6 = 0.1{6}*, 1/9 = 0.{1}*, 1/12 = 0.08{3}* where the sequence of digits {...}* which repeats indefinitely is of length 1.
a(7) = 6 because 1/7 = 0.{142857}* with a period of 6.
a(17) = 16 because 1/17 = 0.{0588235294117647}* with a period of 16.
a(19) = 18 because 1/19 = 0.{052631578947368421}* with a period of 18. (End)

T. D. Noe, Table of n, a(n) for n = 1..10000
Project Euler, Reciprocal cycles: Problem 26
Eric Weisstein's World of Mathematics, Repeating Decimal
Index entries for sequences related to decimal expansion of 1/n

Essentially same as A007732. Cf. A002371, A048595, A006883, A036275, A114205, A114206, A001913.

A051626 := proc(n) local lpow,mpow ;
    if isA003592(n) then
       RETURN(0) ;
    else
       lpow:=1 ;
       while true do
          for mpow from lpow-1 to 0 by -1 do
              if (10^lpow-10^mpow) mod n =0 then
                 RETURN(lpow-mpow) ;
              fi ;
          od ;
          lpow := lpow+1 ;
       od ;
    fi ;
end: # R. J. Mathar, Oct 19 2006

r[x_]:=RealDigits[1/x]; w[x_]:=First[r[x]]; f[x_]:=First[w[x]]; l[x_]:=Last[w[x]]; z[x_]:=Last[r[x]];
d[x_] := Which[IntegerQ[l[x]], 0, IntegerQ[f[x]]==False, Length[f[x]], True, Length[l[x]]]; Table[d[i], {i,1,90}] (* Hans Havermann, Oct 19 2006 *)
fd[n_] := Block[{q},q = Last[First[RealDigits[1/n]]];If[IntegerQ[q], q = {}]; Length[q]];Table[fd[n], {n, 100}] (* Ray Chandler, Dec 06 2006 *)
Table[Length[RealDigits[1/n][[1,-1]]],{n,90}] (* Harvey P. Dale, Jul 03 2011 *)
a[n_] := If[ PowerMod[10, n, n] == 0, 0, MultiplicativeOrder[10, n/2^IntegerExponent[n, 2]/5^IntegerExponent[n, 5]]]; Array[a, 90] (* myself in A003592 and T. D. Noe in A007732 *) (* Robert G. Wilson v, Feb 20 2025 *)

A051626(n)=if(1M. F. Hasler, Dec 14 2015

def A051626(n):
    if isA003592(n):
        return 0
    else:
        lpow=1
        while True:
            for mpow in range(lpow-1,-1,-1):
                if (10**lpow-10**mpow) % n == 0:
                    return lpow-mpow
            lpow += 1 # Kenneth Myers, May 06 2016

from sympy import multiplicity, n_order
def A051626(n): return 0 if (m:=(n>>(~n & n-1).bit_length())//5**multiplicity(5,n)) == 1 else n_order(10,m) # Chai Wah Wu, Aug 11 2022

a(n)=A132726(n,1); a(n)=a(A132740(n)); a(A132741(n))=a(A003592(n))=0. - Reinhard Zumkeller, Aug 27 2007

More terms from James Sellers

cp's OEIS Frontend

A086018 Number of cyclic numbers (A001913) <= 10^n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A243096 Lesser of twin primes (A001359) such that both are full reptend primes (A001913).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A186640 Primes p such that the decimal expansion of 1/p has a periodic part of even length, but are not cyclic numbers (A001913).

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A186641 Primes that are not cyclic numbers (A001913).

Views

Author

Keywords

Comments

Programs

Maple

Python

A098937 Number of cyclic numbers, primes with primitive root 10, (A001913) in the first 10^n primes (A000040).

Views

Author

Keywords

Crossrefs

Programs

Mathematica

Formula

Extensions

A001122 Primes with primitive root 2.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A005596 Decimal expansion of Artin's constant Product_{p=prime} (1-1/(p^2-p)).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

Extensions

A002371 Period of decimal expansion of 1/(n-th prime) (0 by convention for the primes 2 and 5).