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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070387 a(n) = 5^n mod 41. 3
1, 5, 25, 2, 10, 9, 4, 20, 18, 8, 40, 36, 16, 39, 31, 32, 37, 21, 23, 33, 1, 5, 25, 2, 10, 9, 4, 20, 18, 8, 40, 36, 16, 39, 31, 32, 37, 21, 23, 33, 1, 5, 25, 2, 10, 9, 4, 20, 18, 8, 40, 36, 16, 39, 31, 32, 37, 21, 23, 33, 1, 5, 25, 2, 10, 9, 4, 20, 18, 8, 40, 36, 16, 39, 31, 32, 37 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

G. C. Greubel, Table of n, a(n) for n = 0..1000

FORMULA

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

a(n) = a(n-1) - a(n-10) + a(n-11).

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

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

MATHEMATICA

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

PROG

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

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

CROSSREFS

Sequence in context: A270590 A271378 A175555 * A123748 A050108 A070386

Adjacent sequences:  A070384 A070385 A070386 * A070388 A070389 A070390

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 28 22:27 EDT 2017. Contains 284249 sequences.