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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070337 a(n) = 2^n mod 27. 3
1, 2, 4, 8, 16, 5, 10, 20, 13, 26, 25, 23, 19, 11, 22, 17, 7, 14, 1, 2, 4, 8, 16, 5, 10, 20, 13, 26, 25, 23, 19, 11, 22, 17, 7, 14, 1, 2, 4, 8, 16, 5, 10, 20, 13, 26, 25, 23, 19, 11, 22, 17, 7, 14, 1, 2, 4, 8, 16, 5, 10, 20, 13, 26, 25, 23, 19, 11, 22, 17, 7 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

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, 0, 0, 0, 0, -1, 1).

FORMULA

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

a(n) = a(n-1) - a(n-9) + a(n-10).

G.f.: (1+x+2*x^2+4*x^3+8*x^4-11*x^5+5*x^6+10*x^7-7*x^8+14*x^9)/ ((1-x) * (1+x) * (x^ 2-x+1) * (x^6-x^3+1)). (End)

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

MATHEMATICA

PowerMod[2, Range[0, 80], 27] (* Harvey P. Dale, Mar 30 2012 *)

PROG

(Sage) [power_mod(2, n, 27)for n in xrange(0, 71)] # Zerinvary Lajos, Nov 03 2009

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

CROSSREFS

Sequence in context: A033491 A050076 A276070 * A269305 A225570 A178170

Adjacent sequences:  A070334 A070335 A070336 * A070338 A070339 A070340

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, May 12 2002

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 January 19 21:35 EST 2018. Contains 297938 sequences.