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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036121 5^n mod 23. 2
1, 5, 2, 10, 4, 20, 8, 17, 16, 11, 9, 22, 18, 21, 13, 19, 3, 15, 6, 7, 12, 14, 1, 5, 2, 10, 4, 20, 8, 17, 16, 11, 9, 22, 18, 21, 13, 19, 3, 15, 6, 7, 12, 14, 1, 5, 2, 10, 4, 20, 8, 17, 16, 11, 9, 22, 18, 21, 13, 19, 3, 15, 6, 7, 12, 14, 1, 5, 2, 10, 4, 20, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

REFERENCES

I. M. Vinogradov, Elements of Number Theory, pp. 220 ff.

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

FORMULA

a(n) = +a(n-1) -a(n-11) +a(n-12). G.f.: ( -1-4*x+3*x^2-8*x^3+6*x^4-16*x^5+12*x^6-9*x^7+x^8+5*x^9+2*x^10-14*x^11 ) / ( (x-1)*(1+x)*(x^10-x^9+x^8-x^7+x^6-x^5+x^4-x^3+x^2-x+1) ). [R. J. Mathar, Apr 20 2010]

MAPLE

with(numtheory): i=9: [ seq(primroot(ithprime(i))^j mod ithprime(i), j=0..100) ];

MATHEMATICA

Mod[5^Range[0, 50], 23] (* Wesley Ivan Hurt, Jul 06 2014 *)

PROG

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

(MAGMA) [5^n mod 23: n in [0..80]]; // Vincenzo Librandi, Feb 07 2011

CROSSREFS

Sequence in context: A040024 A196385 A178714 * A162396 A194046 A249368

Adjacent sequences:  A036118 A036119 A036120 * A036122 A036123 A036124

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified November 21 21:29 EST 2014. Contains 249791 sequences.