A355858 a(n) = n^(2*n-1) mod (2*n-1).

0, 2, 3, 4, 8, 6, 7, 2, 9, 10, 8, 12, 18, 26, 15, 16, 29, 2, 19, 5, 21, 22, 8, 24, 18, 32, 27, 32, 50, 30, 31, 8, 63, 34, 26, 36, 37, 32, 30, 40, 80, 42, 8, 11, 45, 32, 35, 22, 49, 35, 51, 52, 8, 54, 55, 14, 57, 87, 8, 2, 94, 77, 68, 64, 113, 66, 53, 107, 69

Offset

1,2

Comments

If a(n) = n then 2*n-1 is prime or Fermat pseudoprime to base 2.

Links

Table of n, a(n) for n=1..69.

Mathematica

a[n_] := PowerMod[n, 2*n - 1, 2*n - 1]; Array[a, 100] (* Amiram Eldar, Jul 23 2022 *)

Prog

(PARI) a(n)=n^(2*n-1)%(2*n-1)
(PARI) a(n)=lift(Mod(n, 2*n-1)^(2*n-1)) \\ Rémy Sigrist, Jul 21 2022
(Python)
def a(n): return pow(n, 2*n-1, 2*n-1)
print([a(n) for n in range(1, 70)]) # Michael S. Branicky, Jul 23 2022

Crossrefs

Cf. A000040, A001567, A006254, A085524, A174166, A179976.

Sequence in context: A329567 A326487 A253562 * A222247 A338242 A353827

Adjacent sequences: A355855 A355856 A355857 * A355859 A355860 A355861

Keyword

nonn

Author

Jonas Kaiser, Jul 20 2022

Status

approved