|
| |
| |
|
|
|
1, 2, 4, 8, 5, 10, 9, 7, 3, 6, 1, 2, 4, 8, 5, 10, 9, 7, 3, 6, 1, 2, 4, 8, 5, 10, 9, 7, 3, 6, 1, 2, 4, 8, 5, 10, 9, 7, 3, 6, 1, 2, 4, 8, 5, 10, 9, 7, 3, 6, 1, 2, 4, 8, 5, 10, 9, 7, 3, 6, 1, 2, 4, 8, 5, 10, 9, 7, 3, 6, 1, 2, 4, 8, 5, 10, 9, 7
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
REFERENCES
| H. Cohn, A Second Course in Number Theory, Wiley, NY, 1962, p. 256.
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-5) +a(n-6). G.f.: (1+x+2*x^2+4*x^3-3*x^4+6*x^5)/ ((1-x) * (1+x) * (x^4-x^3+x^2-x+1)). [From R. J. Mathar, Apr 13 2010]
|
|
|
MAPLE
| [ seq(primroot(ithprime(i))^j mod ithprime(i), j=0..100) ]; (with i=5).
|
|
|
MATHEMATICA
| Table[Mod[2^n, 11], {n, 0, 6!}] [From Vladimir Orlovsky, Apr 29 2010]
|
|
|
PROG
| (Sage) [power_mod(2, n, 11) for n in xrange(0, 78)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 03 2009]
(MAGMA) [2^n mod 11: n in [0..80]]; // Vincenzo Librandi, Aug 24 2011
|
|
|
CROSSREFS
| Cf. A008830.
See also A168429. [From Kailasam Viswanathan Iyer, Mar 18 2010]
Sequence in context: A146079 A165669 A021893 * A116624 A125733 A000689
Adjacent sequences: A036114 A036115 A036116 * A036118 A036119 A036120
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
