login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070397 a(n) = 6^n mod 25. 1
1, 6, 11, 16, 21, 1, 6, 11, 16, 21, 1, 6, 11, 16, 21, 1, 6, 11, 16, 21, 1, 6, 11, 16, 21, 1, 6, 11, 16, 21, 1, 6, 11, 16, 21, 1, 6, 11, 16, 21, 1, 6, 11, 16, 21, 1, 6, 11, 16, 21, 1, 6, 11, 16, 21, 1, 6, 11, 16, 21, 1, 6, 11, 16, 21, 1, 6, 11, 16, 21, 1, 6, 11, 16, 21, 1, 6, 11, 16 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = a(n-5). - R. J. Mathar, Apr 20 2010
G.f.: ( -1-6*x-11*x^2-16*x^3-21*x^4 ) / ((x-1)*(1+x+x^2+x^3+x^4)). - R. J. Mathar, Apr 20 2010
MATHEMATICA
PowerMod[6, Range[0, 80], 25] (* Harvey P. Dale, Jul 22 2013 *)
PROG
(Sage) [power_mod(6, n, 25)for n in range(0, 79)] # Zerinvary Lajos, Nov 27 2009
(PARI) a(n) = lift(Mod(6, 25)^n); \\ Altug Alkan, Mar 18 2016
CROSSREFS
Sequence in context: A315454 A315455 A315456 * A080904 A081746 A080900
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 11:39 EDT 2024. Contains 371969 sequences. (Running on oeis4.)