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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070413 a(n) = 7^n mod 29. 2
1, 7, 20, 24, 23, 16, 25, 1, 7, 20, 24, 23, 16, 25, 1, 7, 20, 24, 23, 16, 25, 1, 7, 20, 24, 23, 16, 25, 1, 7, 20, 24, 23, 16, 25, 1, 7, 20, 24, 23, 16, 25, 1, 7, 20, 24, 23, 16, 25, 1, 7, 20, 24, 23, 16, 25, 1, 7, 20, 24, 23, 16, 25, 1, 7, 20, 24, 23, 16, 25, 1, 7, 20, 24, 23, 16, 25 (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,0,1).

FORMULA

a(n) = (1/147)*{620*(n mod 7)-73*[(n+1) mod 7]+263*[(n+2) mod 7]+137*[(n+3) mod 7]+32*[(n+4) mod 7]-157*[(n+5) mod 7]-10*[(n+6) mod 7]}, with n>=0. - Paolo P. Lava, Feb 25 2010

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

a(n) = a(n-7).

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

MATHEMATICA

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

PROG

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

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

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

CROSSREFS

Sequence in context: A209553 A037005 A022419 * A015243 A055069 A134863

Adjacent sequences:  A070410 A070411 A070412 * A070414 A070415 A070416

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 May 24 11:40 EDT 2017. Contains 286975 sequences.