A070356 a(n) = 3^n mod 23.

1, 3, 9, 4, 12, 13, 16, 2, 6, 18, 8, 1, 3, 9, 4, 12, 13, 16, 2, 6, 18, 8, 1, 3, 9, 4, 12, 13, 16, 2, 6, 18, 8, 1, 3, 9, 4, 12, 13, 16, 2, 6, 18, 8, 1, 3, 9, 4, 12, 13, 16, 2, 6, 18, 8, 1, 3, 9, 4, 12, 13, 16, 2, 6, 18, 8, 1, 3, 9, 4, 12, 13, 16, 2, 6, 18, 8, 1, 3, 9, 4, 12, 13, 16, 2, 6, 18, 8

Offset: 0

Author

N. J. A. Sloane, May 12 2002

Keywords

• nonn
• easy

Links

• G. C. Greubel, Table of n, a(n) for n = 0..1000
• Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,0,0,0,1).

Crossrefs

Cf. A000244.

Programs

Mathematica

PowerMod[3, Range[0,50], 23] (* or *) Table[Mod[3^n, 23], {n, 0, 100}] (* G. C. Greubel, Mar 09 2016 *)

PARI

a(n)=lift(Mod(3,23)^n) \\ Charles R Greathouse IV, Mar 22 2016

Sage

[power_mod(3,n,23)for n in range(0, 88)] # Zerinvary Lajos, Nov 25 2009

Formula

a(n) = a(n-11). - Vincenzo Librandi, Feb 06 2011