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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070391 a(n) = 5^n mod 46. 1
1, 5, 25, 33, 27, 43, 31, 17, 39, 11, 9, 45, 41, 21, 13, 19, 3, 15, 29, 7, 35, 37, 1, 5, 25, 33, 27, 43, 31, 17, 39, 11, 9, 45, 41, 21, 13, 19, 3, 15, 29, 7, 35, 37, 1, 5, 25, 33, 27, 43, 31, 17, 39, 11, 9, 45, 41, 21, 13, 19, 3, 15, 29, 7, 35, 37, 1, 5, 25, 33, 27, 43, 31, 17, 39 (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

a(n) = 2*a(n-1) -2*a(n-2) +2*a(n-3) -2*a(n-4) +2*a(n-5) -2*a(n-6) +2*a(n-7) -2*a(n-8) +2*a(n-9) -2*a(n-10) +a(n-11). - R. J. Mathar, Apr 20 2010

a(n) = a(n-22). - G. C. Greubel, Mar 18 2016

PROG

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

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

CROSSREFS

Sequence in context: A291755 A018639 A029475 * A084967 A249827 A279541

Adjacent sequences:  A070388 A070389 A070390 * A070392 A070393 A070394

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 19 03:34 EDT 2019. Contains 328211 sequences. (Running on oeis4.)