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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A094918 a(n) = (3^n-1)/2 mod n. 2
 0, 0, 1, 0, 1, 4, 1, 0, 4, 4, 1, 4, 1, 4, 13, 0, 1, 4, 1, 0, 13, 4, 1, 16, 21, 4, 13, 12, 1, 4, 1, 0, 13, 4, 23, 4, 1, 4, 13, 0, 1, 28, 1, 40, 31, 4, 1, 16, 15, 24, 13, 40, 1, 40, 33, 32, 13, 4, 1, 40, 1, 4, 13, 0, 56, 34, 1, 40, 13, 54, 1, 40, 1, 4, 28, 40, 37, 52, 1, 0, 40, 4, 1, 28, 36, 4, 13, 24 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS Antti Karttunen, Table of n, a(n) for n = 1..16384 Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537 PROG (PARI) A094918(n) = lift(Mod((3^n-1)/2, n)); \\ Antti Karttunen, May 19 2020 CROSSREFS (k^n-1)/(k-1) mod n for k = 1, ..., 10 gives A082495, this sequence, A094919, A094920, A094921, A094922, A094923, A094924 and A095250. Cf. A003462. Sequence in context: A266392 A021713 A122388 * A110146 A126217 A303499 Adjacent sequences:  A094915 A094916 A094917 * A094919 A094920 A094921 KEYWORD nonn,look AUTHOR N. J. A. Sloane, Jun 18 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 September 20 05:58 EDT 2020. Contains 337264 sequences. (Running on oeis4.)