A070392 - OEIS

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

(list; graph; refs; listen; history; text; internal format)

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 *)