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

 

Logo

"Email this user" was broken Aug 14 to 9am Aug 16. If you sent someone a message in this period, please send it again.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070383 a(n) = 5^n mod 36. 1
1, 5, 25, 17, 13, 29, 1, 5, 25, 17, 13, 29, 1, 5, 25, 17, 13, 29, 1, 5, 25, 17, 13, 29, 1, 5, 25, 17, 13, 29, 1, 5, 25, 17, 13, 29, 1, 5, 25, 17, 13, 29, 1, 5, 25, 17, 13, 29, 1, 5, 25, 17, 13, 29, 1, 5, 25, 17, 13, 29, 1, 5, 25, 17, 13, 29, 1, 5, 25, 17, 13, 29, 1, 5, 25, 17, 13, 29 (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 (0,0,0,0,0,1). [R. J. Mathar, Apr 20 2010]

FORMULA

a(n) = (1/3)*{17*(n mod 6)-5*[(n+1) mod 6]+5*[(n+2) mod 6]+7*[(n+3) mod 6]-7*[(n+4) mod 6]+[(n+5) mod 6]}, with n>=0. - Paolo P. Lava, Apr 16 2010

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

a(n) = a(n-6).

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

MATHEMATICA

PowerMod[5, Range[0, 50], 36] (* G. C. Greubel, Mar 16 2016 *)

PROG

(Sage) [power_mod(5, n, 36) for n in xrange(0, 78)] # Zerinvary Lajos, Nov 26 2009

(PARI) a(n) = lift(Mod(5, 36)^n); \\ Altug Alkan, Mar 16 2016

CROSSREFS

Sequence in context: A070378 A070384 A070377 * A070061 A070376 A036139

Adjacent sequences:  A070380 A070381 A070382 * A070384 A070385 A070386

KEYWORD

nonn

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 August 20 03:34 EDT 2017. Contains 290823 sequences.