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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A297966 a(n) = 3^n mod prime(n). 2
1, 0, 2, 4, 1, 1, 11, 6, 18, 5, 13, 10, 38, 36, 42, 15, 19, 34, 5, 32, 46, 51, 49, 39, 94, 30, 73, 53, 9, 91, 114, 100, 79, 121, 38, 127, 122, 113, 126, 138, 82, 114, 118, 112, 119, 10, 108, 30, 188, 20, 188, 30, 174, 169, 5, 52, 15, 241, 202, 222, 50, 267 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..5000

FORMULA

a(n) = A000244(n) mod A000040(n).

MAPLE

seq(3 &^ n mod ithprime(n), n=1..65); # Muniru A Asiru, Mar 12 2018

MATHEMATICA

Array[PowerMod[3, #, Prime@#]&, 80]

PROG

(MAGMA) [Modexp(3, n, NthPrime(n)): n in [1..80]];

(PARI) a(n) = lift(Mod(3, prime(n))^n); \\ Michel Marcus, Jan 11 2018

(GAP) P:=Filtered([1..1500], IsPrime);; List([1..65], n->PowerModInt(3, n, P[n])); # Muniru A Asiru, Mar 12 2018

CROSSREFS

Cf. A000040, A000244, A064367, A066601.

Sequence in context: A201287 A236367 A197489 * A103161 A030420 A133902

Adjacent sequences:  A297963 A297964 A297965 * A297967 A297968 A297969

KEYWORD

nonn,easy

AUTHOR

Vincenzo Librandi, Jan 11 2018

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 24 11:38 EDT 2020. Contains 337318 sequences. (Running on oeis4.)