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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070416 a(n) = 7^n mod 32. 1
1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23 (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,1).

FORMULA

From Paolo P. Lava, Apr 16 2010: (Start)

a(n) = (1/2)*{15*(n mod 4)+[(n+1) mod 4]-[(n+2) mod 4]+[(n+3) mod 4]}, with n>=0.

a(n) = 12 - 4*(1-I)*I^n - 3*(-1)^n - 4*(1+I)*(-I)^n, with n>=0 and I=sqrt(-1). (End)

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

a(n) = a(n-4).

G.f.: ( -1-7*x-17*x^2-23*x^3 ) / ( (x-1)*(1+x)*(1+x^2) ). (End)

E.g.f.: 9*cosh(x) + 15*sinh(x) - 8*cos(x) - 8*sin(x). - G. C. Greubel, Mar 20 2016

MATHEMATICA

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

PROG

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

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

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

CROSSREFS

Sequence in context: A053746 A144695 A125244 * A087168 A247560 A215824

Adjacent sequences:  A070413 A070414 A070415 * A070417 A070418 A070419

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 23 19:46 EDT 2017. Contains 286926 sequences.