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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070379 a(n) = 5^n mod 29. 3
1, 5, 25, 9, 16, 22, 23, 28, 24, 4, 20, 13, 7, 6, 1, 5, 25, 9, 16, 22, 23, 28, 24, 4, 20, 13, 7, 6, 1, 5, 25, 9, 16, 22, 23, 28, 24, 4, 20, 13, 7, 6, 1, 5, 25, 9, 16, 22, 23, 28, 24, 4, 20, 13, 7, 6, 1, 5, 25, 9, 16, 22, 23, 28, 24, 4, 20, 13, 7, 6, 1, 5, 25, 9, 16, 22, 23, 28, 24, 4, 20 (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,-1,1).

FORMULA

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

a(n) = a(n-1) - a(n-7) + a(n-8).

G.f.: ( -1-4*x-20*x^2+16*x^3-7*x^4-6*x^5-x^6-6*x^7 ) / ( (x-1)*(1+x)*(x^6-x^5+x^4-x^3+x^2-x+1) ). (End)

a(n) = a(n-14). - G. C. Greubel, Mar 16 2016

MATHEMATICA

PowerMod[5, Range[0, 90], 29] (* Harvey P. Dale, Nov 13 2011 *)

PROG

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

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

(MAGMA) [Modexp(5, n, 29): n in [0..100]]; // Bruno Berselli, Mar 23 2016

CROSSREFS

Sequence in context: A050108 A070386 A050084 * A143254 A070385 A070378

Adjacent sequences:  A070376 A070377 A070378 * A070380 A070381 A070382

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 June 25 06:13 EDT 2017. Contains 288709 sequences.