The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A094593 a(n) = (p-1)/x, where p = prime(n) and x = ord(3,p), the smallest positive integer such that 3^x == 1 mod p. 9
 1, 1, 2, 4, 1, 1, 2, 1, 1, 2, 5, 1, 2, 1, 2, 6, 3, 2, 6, 1, 2, 1, 2, 1, 3, 2, 4, 1, 1, 2, 1, 1, 1, 3, 2, 1, 2, 1, 2, 4, 2, 12, 1, 1, 1, 1, 2, 4, 1, 2, 2, 2, 1, 2, 1, 9, 4, 1, 1, 1, 9, 2, 8, 1, 1, 2, 2, 2, 1, 2, 3, 2, 1, 2, 1, 2, 1, 2, 2, 4, 10, 16, 3, 2, 1, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,3 LINKS T. D. Noe, Table of n, a(n) for n = 3..1000 FORMULA a(n) = (A000040(n)-1)/A062117(n). PROG (PARI) a(n)=(prime(n)-1)/if(n<0, 0, k=1; while((3^k-1)%prime(n)>0, k++); k) (Python) from sympy import prime, n_order def A094593(n):     p = prime(n)     return 1 if n == 3 else (p-1)//n_order(3, p) # Chai Wah Wu, Jan 15 2020 CROSSREFS Cf. A001917. Sequence in context: A177196 A010741 A094643 * A327814 A188348 A336434 Adjacent sequences:  A094590 A094591 A094592 * A094594 A094595 A094596 KEYWORD nonn AUTHOR Benoit Cloitre, Jun 06 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 8 23:37 EST 2021. Contains 349596 sequences. (Running on oeis4.)