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

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

0,2

COMMENTS

The sequence is 28-periodic.

REFERENCES

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

FORMULA

a(n)= +a(n-1) -a(n-14) +a(n-15). G.f. ( -1-x-2*x^2-4*x^3-8*x^4+13*x^5-3*x^6-6*x^7-12*x^8+5*x^9+10*x^10-9*x^11+11*x^12-7*x^13-15*x^14 ) / ( (x-1)*(x^2+1)*(x^12-x^10+x^8-x^6+x^4-x^2+1) ). - R. J. Mathar, Feb 06 2011

MAPLE

i := pi(29) ; [ seq(primroot(ithprime(i))^j mod ithprime(i), j=0..100) ];

MATHEMATICA

Mod[#, 29]&/@(2^Range[0, 100])  (* From Harvey P. Dale, Mar 3 2011 *)

PROG

(Other) sage: [power_mod(2, n, 29)for n in xrange(0, 62)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 03 2009]

(MAGMA) [ 2^n mod 29: n in [0..65]]; // From Vincenzo Librandi, Feb 05 2011

CROSSREFS

Sequence in context: A110333 A069783 A102251 * A050124 A101943 A110001

Adjacent sequences:  A036119 A036120 A036121 * A036123 A036124 A036125

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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

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

Last modified February 16 06:16 EST 2012. Contains 205860 sequences.