login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A070345
a(n) = 3^n mod 35.
1
1, 3, 9, 27, 11, 33, 29, 17, 16, 13, 4, 12, 1, 3, 9, 27, 11, 33, 29, 17, 16, 13, 4, 12, 1, 3, 9, 27, 11, 33, 29, 17, 16, 13, 4, 12, 1, 3, 9, 27, 11, 33, 29, 17, 16, 13, 4, 12, 1, 3, 9, 27, 11, 33, 29, 17, 16, 13, 4, 12, 1, 3, 9, 27, 11, 33, 29, 17, 16, 13, 4, 12
OFFSET
0,2
LINKS
Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
FORMULA
a(n) = a(n-12). - G. C. Greubel, Mar 11 2016
MATHEMATICA
PowerMod[3, Range[0, 80], 35] (* Harvey P. Dale, Oct 28 2011 *)
PROG
(PARI) a(n)=lift(Mod(3, 35)^n) \\ Charles R Greathouse IV, Mar 22 2016
CROSSREFS
Sequence in context: A248131 A070346 A328754 * A272584 A070359 A271015
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 12 2002
STATUS
approved