The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062117 Order of 3 mod n-th prime. 19
1, 0, 4, 6, 5, 3, 16, 18, 11, 28, 30, 18, 8, 42, 23, 52, 29, 10, 22, 35, 12, 78, 41, 88, 48, 100, 34, 53, 27, 112, 126, 65, 136, 138, 148, 50, 78, 162, 83, 172, 89, 45, 95, 16, 196, 198, 210, 222, 113, 57, 232, 119, 120, 125, 256, 131, 268, 30, 69, 280, 282, 292, 34 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
EXAMPLE
The 3rd prime is 5 and mod 5, 3^4 = 1, so a(3) = 4.
MATHEMATICA
Table[With[{p=Prime[n]}, If[p==3, 0, MultiplicativeOrder[3, p]]], {n, 63}] (* Ray Chandler, Apr 06 2016 *)
PROG
(GAP) A000040:=Filtered([1..350], IsPrime);;
List([1..Length(A000040)], n->OrderMod(3, A000040[n])); # Muniru A Asiru, Feb 07 2019
(Python)
from sympy import n_order, prime
def A062117(n): return n_order(3, prime(n)) if n != 2 else 0 # Chai Wah Wu, Nov 10 2023
(PARI) a(n, {base=3}) = my(p=prime(n)); if(base%p, znorder(Mod(base, p)), 0) \\ Jianing Song, May 13 2024
CROSSREFS
Cf. A019334 (full reptend primes in base 3).
Sequence in context: A256682 A303404 A002245 * A200497 A271365 A088559
KEYWORD
easy,nonn,changed
AUTHOR
Olivier Gérard, Jun 06 2001
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 14 09:52 EDT 2024. Contains 372532 sequences. (Running on oeis4.)