login
This site is supported by donations 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

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-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)

a(n) = (1/605)*{257*(n mod 11)+752*[(n+1) mod 11]+202*[(n+2) mod 11]-733*[(n+3) mod 11]+587*[(n+4) mod 11]-458*[(n+5) mod 11]+422*[(n+6) mod 11]+147*[(n+7) mod 11]+312*[(n+8) mod 11]-293*[(n+9) mod 11]-183*[(n+10) mod 11]}, with n>=0. - Paolo P. Lava, Apr 23 2010

MATHEMATICA

PowerMod[6, Range[0, 90], 23] (* Harvey P. Dale, Sep 15 2011 *)

PROG

(Sage) [power_mod(6, n, 23)for n in xrange(0, 88)] # Zerinvary Lajos, Nov 27 2009

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

CROSSREFS

Sequence in context: A202383 A216423 A229336 * A130012 A265740 A090324

Adjacent sequences:  A070393 A070394 A070395 * A070397 A070398 A070399

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 25 13:42 EDT 2017. Contains 284081 sequences.