A070392 a(n) = 6^n mod 11.

1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7

Offset

0,2

Comments

Period 10 (Repeat): [1, 6, 3, 7, 9, 10, 5, 8, 4, 2, ...]. The sequence contains every number from 1 to 10 and only those numbers. - Wesley Ivan Hurt, May 19 2014

Links

G. C. Greubel, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,-1,1). - R. J. Mathar, Apr 20 2010

Formula

From R. J. Mathar, Apr 20 2010: (Start)

a(n) = a(n-1) - a(n-5) + a(n-6).

G.f.: ( -1-5*x+3*x^2-4*x^3-2*x^4-2*x^5 )/((x-1)*(1+x)(x^4-x^3+x^2-x+1) ). (End)

a(n) = a(n-10). - G. C. Greubel, Mar 18 2016

Maple

A070392:=n->(6^n mod 11); seq(A070392(n), n=0..100); # Wesley Ivan Hurt, May 19 2014

Mathematica

Table[Mod[6^n, 11], {n, 0, 100}] (* Wesley Ivan Hurt, May 19 2014 *)
PowerMod[6, Range[0, 50], 11] (* G. C. Greubel, Mar 18 2016 *)

Prog

(Sage) [power_mod(6, n, 11)for n in range(0, 99)] # Zerinvary Lajos, Nov 26 2009
(PARI) a(n)=6^n%11 \\ Charles R Greathouse IV, Oct 07 2015
(PARI) a(n) = lift(Mod(6, 11)^n); \\ Altug Alkan, Mar 18 2016

Crossrefs

Sequence in context: A125123 A133612 A221149 * A248268 A115371 A371376

Adjacent sequences: A070389 A070390 A070391 * A070393 A070394 A070395

Keyword

nonn,easy

Author

N. J. A. Sloane, May 12 2002

Status

approved