login
A070339
a(n) = 2^n mod 35.
2
1, 2, 4, 8, 16, 32, 29, 23, 11, 22, 9, 18, 1, 2, 4, 8, 16, 32, 29, 23, 11, 22, 9, 18, 1, 2, 4, 8, 16, 32, 29, 23, 11, 22, 9, 18, 1, 2, 4, 8, 16, 32, 29, 23, 11, 22, 9, 18, 1, 2, 4, 8, 16, 32, 29, 23, 11, 22, 9, 18, 1, 2, 4, 8, 16, 32, 29, 23, 11, 22, 9, 18
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 13 2016
MATHEMATICA
PowerMod[2, Range[0, 50], 35] (* G. C. Greubel, Mar 13 2016 *)
PROG
(Sage) [power_mod(2, n, 35)for n in range(0, 72)] # Zerinvary Lajos, Nov 03 2009
(PARI) a(n)=lift(Mod(2, 35)^n) \\ Charles R Greathouse IV, Mar 22 2016
(GAP) List([0..83], n->PowerMod(2, n, 35)); # Muniru A Asiru, Jan 30 2019
CROSSREFS
Sequence in context: A130670 A070340 A036124 * A070338 A331380 A115423
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 12 2002
STATUS
approved