|
| |
| |
|
|
|
1, 2, 4, 8, 16, 13, 7, 14, 9, 18, 17, 15, 11, 3, 6, 12, 5, 10, 1, 2, 4, 8, 16, 13, 7, 14, 9, 18, 17, 15, 11, 3, 6, 12, 5, 10, 1, 2, 4, 8, 16, 13, 7, 14, 9, 18, 17, 15, 11, 3, 6, 12, 5, 10, 1, 2, 4, 8, 16, 13, 7, 14, 9, 18, 17, 15
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| The sequence can be generated via a(n) = A061762(a(n-1)). Apparently any other choice of the first element leads also to periodic sequences, with fixed points of A061762 as special cases. - Zak Seidov (zakzeidov(AT)yahoo.com), Aug 22 2007
|
|
|
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-9) +a(n-10). G.f.: (1+x+2*x^2+4*x^3+8*x^4-3*x^5-6*x^6+7*x^7-5*x^8+10*x^9)/ ((1-x) * (1+x) * (x^2- x+1) * (x^6-x^3+1)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 13 2010]
a(n) = a(n+18); [Vincenzo Librandi, Sep 09 2011]
|
|
|
MAPLE
| with(numtheory) ; i := pi(19) ; [ seq(primroot(ithprime(i))^j mod ithprime(i), j=0..100) ];
|
|
|
PROG
| (Other) sage: [power_mod(2, n, 19)for n in xrange(0, 66)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 03 2009]
(MAGMA) [2^n mod 19 : n in [0..80]]; // Vincenzo Librandi, Sep 09 2011
|
|
|
CROSSREFS
| Sequence in context: A020954 A070347 A095915 * A108565 A066005 A066600
Adjacent sequences: A036117 A036118 A036119 * A036121 A036122 A036123
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
