login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A167421 2^n mod 22. 0
1, 2, 4, 8, 16, 10, 20, 18, 14, 6, 12, 2, 4, 8, 16, 10, 20, 18, 14, 6, 12, 2, 4, 8, 16, 10, 20, 18, 14, 6, 12, 2, 4, 8, 16, 10, 20, 18, 14, 6, 12, 2, 4, 8, 16, 10, 20, 18, 14, 6, 12, 2, 4, 8, 16, 10, 20, 18, 14, 6, 12, 2, 4, 8, 16, 10, 20, 18, 14, 6, 12, 2, 4, 8, 16, 10, 20, 18, 14, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..79.

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

FORMULA

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

MATHEMATICA

PowerMod[2, Range[0, 80], 22] (* Harvey P. Dale, Dec 11 2012 *)

PROG

(Sage) [power_mod(2, n, 22)for n in range(0, 84)] #

(PARI) a(n)=lift(Mod(2, 22)^n) \\ Charles R Greathouse IV, Mar 22 2016

CROSSREFS

Sequence in context: A277846 A277845 A277858 * A020954 A070347 A342072

Adjacent sequences:  A167418 A167419 A167420 * A167422 A167423 A167424

KEYWORD

nonn,easy

AUTHOR

Zerinvary Lajos, Nov 03 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 7 00:43 EDT 2021. Contains 343610 sequences. (Running on oeis4.)