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!)
A070396 a(n) = 6^n mod 23. 1
1, 6, 13, 9, 8, 2, 12, 3, 18, 16, 4, 1, 6, 13, 9, 8, 2, 12, 3, 18, 16, 4, 1, 6, 13, 9, 8, 2, 12, 3, 18, 16, 4, 1, 6, 13, 9, 8, 2, 12, 3, 18, 16, 4, 1, 6, 13, 9, 8, 2, 12, 3, 18, 16, 4, 1, 6, 13, 9, 8, 2, 12, 3, 18, 16, 4, 1, 6, 13, 9, 8, 2, 12, 3, 18, 16, 4, 1, 6, 13, 9, 8, 2, 12, 3, 18, 16, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
FORMULA
From R. J. Mathar, Apr 20 2010: (Start)
a(n) = a(n-11).
G..f: ( -1-6*x-13*x^2-9*x^3-8*x^4-2*x^5-12*x^6-3*x^7-18*x^8-16*x^9-4*x^10 ) / ( (x-1)*(1+x+x^2+x^3+x^4+x^5+x^6+x^7+x^8+x^9+x^10) ). (End)
MATHEMATICA
PowerMod[6, Range[0, 90], 23] (* Harvey P. Dale, Sep 15 2011 *)
PROG
(Sage) [power_mod(6, n, 23)for n in range(0, 88)] # Zerinvary Lajos, Nov 27 2009
(PARI) a(n) = lift(Mod(6, 23)^n); \\ Altug Alkan, Mar 18 2016
CROSSREFS
Sequence in context: A216423 A229336 A363755 * A359091 A130012 A265740
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 06:15 EDT 2024. Contains 371265 sequences. (Running on oeis4.)