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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070398 a(n) = 6^n mod 29. 1
1, 6, 7, 13, 20, 4, 24, 28, 23, 22, 16, 9, 25, 5, 1, 6, 7, 13, 20, 4, 24, 28, 23, 22, 16, 9, 25, 5, 1, 6, 7, 13, 20, 4, 24, 28, 23, 22, 16, 9, 25, 5, 1, 6, 7, 13, 20, 4, 24, 28, 23, 22, 16, 9, 25, 5, 1, 6, 7, 13, 20, 4, 24, 28, 23, 22, 16, 9, 25, 5, 1, 6, 7, 13, 20, 4, 24, 28, 23, 22, 16 (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). [From R. J. Mathar, Apr 20 2010]

FORMULA

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

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

G.f.: ( -1-5*x-x^2-6*x^3-7*x^4+16*x^5-20*x^6-5*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 18 2016

MATHEMATICA

PowerMod[6, Range[0, 50], 29] (* G. C. Greubel, Mar 18 2016 *)

PROG

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

(PARI) a(n) = lift(Mod(6, 29)^n); \\ Altug Alkan, Mar 18 2016

CROSSREFS

Sequence in context: A127020 A154662 A277567 * A022096 A041175 A041074

Adjacent sequences:  A070395 A070396 A070397 * A070399 A070400 A070401

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 March 27 06:19 EDT 2017. Contains 284144 sequences.