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!)
A070375 a(n) = 5^n mod 22. 1
1, 5, 3, 15, 9, 1, 5, 3, 15, 9, 1, 5, 3, 15, 9, 1, 5, 3, 15, 9, 1, 5, 3, 15, 9, 1, 5, 3, 15, 9, 1, 5, 3, 15, 9, 1, 5, 3, 15, 9, 1, 5, 3, 15, 9, 1, 5, 3, 15, 9, 1, 5, 3, 15, 9, 1, 5, 3, 15, 9, 1, 5, 3, 15, 9, 1, 5, 3, 15, 9, 1, 5, 3, 15, 9, 1, 5, 3, 15, 9, 1, 5, 3, 15, 9, 1, 5, 3, 15, 9, 1, 5, 3, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
From R. J. Mathar, Apr 20 2010: (Start)
a(n) = a(n-5).
G.f.: ( -1-5*x-3*x^2-15*x^3-9*x^4 ) / ( (x-1)*(1+x+x^2+x^3+x^4) ). (End)
MAPLE
A070375:=n->5^n mod 22: seq(A070375(n), n=0..100); # Wesley Ivan Hurt, Mar 13 2016
MATHEMATICA
PowerMod[5, Range[0, 50], 22] (* G. C. Greubel, Mar 13 2016 *)
PadRight[{}, 120, {1, 5, 3, 15, 9}] (* Harvey P. Dale, Sep 30 2019 *)
PROG
(Sage) [power_mod(5, n, 22) for n in range(0, 94)] # Zerinvary Lajos, Nov 26 2009
(PARI) a(n)=lift(Mod(5, 22)^n) \\ Charles R Greathouse IV, Mar 22 2016
CROSSREFS
Sequence in context: A329029 A248983 A298975 * A166465 A162813 A146934
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 March 28 15:38 EDT 2024. Contains 371254 sequences. (Running on oeis4.)