login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A168429 a(n) = 4^n mod 11. 6
1, 4, 5, 9, 3, 1, 4, 5, 9, 3, 1, 4, 5, 9, 3, 1, 4, 5, 9, 3, 1, 4, 5, 9, 3, 1, 4, 5, 9, 3, 1, 4, 5, 9, 3, 1, 4, 5, 9, 3, 1, 4, 5, 9, 3, 1, 4, 5, 9, 3, 1, 4, 5, 9, 3, 1, 4, 5, 9, 3, 1, 4, 5, 9, 3, 1, 4, 5, 9, 3, 1, 4, 5, 9, 3, 1, 4, 5, 9, 3, 1, 4, 5, 9, 3, 1, 4, 5, 9, 3, 1, 4, 5, 9, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Period 5: repeat [1, 4, 5, 9, 3].

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,1).

FORMULA

a(n) = a(n-5). G.f.: (1+4*x+5*x^2+9*x^3+3*x^4)/((1-x) * (1+x+x^2+x^3+x^4)). - R. J. Mathar, Apr 13 2010

MATHEMATICA

Table[Mod[4^n, 11], {n, 0, 50}] (* G. C. Greubel, Mar 05 2016 *)

PROG

(Sage) [power_mod(4, n, 11) for n in xrange(0, 95)]

(PARI) a(n)=4^n%11 \\ Charles R Greathouse IV, Oct 16 2015

CROSSREFS

See also A036117.

Sequence in context: A197821 A046570 A274412 * A195787 A010667 A016722

Adjacent sequences:  A168426 A168427 A168428 * A168430 A168431 A168432

KEYWORD

nonn,easy

AUTHOR

Zerinvary Lajos, Nov 25 2009

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified September 26 01:25 EDT 2017. Contains 292500 sequences.