|
| |
| |
|
|
|
1, 2, 4, 8, 16, 15, 13, 9, 1, 2, 4, 8, 16, 15, 13, 9, 1, 2, 4, 8, 16, 15, 13, 9, 1, 2, 4, 8, 16, 15, 13, 9, 1, 2, 4, 8, 16, 15, 13, 9, 1, 2, 4, 8, 16, 15, 13, 9, 1, 2, 4, 8, 16, 15, 13, 9, 1, 2, 4, 8, 16, 15, 13, 9, 1, 2, 4, 8, 16, 15, 13, 9, 1, 2, 4, 8, 16, 15, 13, 9, 1, 2, 4, 8, 16, 15, 13
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| Terms of the simple continued fraction of 678982/[sqrt(10997122748477)-2846611]. [From Paolo P. Lava (paoloplava(AT)gmail.com), Aug 06 2009]
|
|
|
REFERENCES
| I. M. Vinogradov, Elements of Number Theory, pp. 220 ff.
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=0,...,1000
Index to sequences with linear recurrences with constant coefficients, signature (1,0,0,-1,1)
|
|
|
FORMULA
| Period 8.
a(n)=1/56*{73*(n mod 8)+45*[(n+1) mod 8]+31*[(n+2) mod 8]+24*[(n+3) mod 8]-39*[(n+4) mod 8]-11*[(n+5) mod 8]+3*[(n+6) mod 8]+10*[(n+7) mod 8]} with n>=0 - Paolo P. Lava (paoloplava(AT)gmail.com), Nov 24 2006
a(n)= +a(n-1) -a(n-4) +a(n-5). G.f.: (1+x+2*x^2+4*x^3+9*x^4)/((1-x) * (1+x^4)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 13 2010]
|
|
|
EXAMPLE
| a(5) = 32 (mod 17) = 15.
|
|
|
MATHEMATICA
| Mod[#, 17]&/@(2^Range[0, 100]) (* From Harvey P. Dale, Mar 6 2011 *)
|
|
|
PROG
| (PARI) { for (n=0, 1000, write("b062116.txt", n, " ", 2^n%17) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 01 2009]
(Other) sage: [power_mod(2, n, 17)for n in xrange(0, 87)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 03 2009]
(MAGMA) [ 2^n mod 17: n in [0..65]]; // From Vincenzo Librandi, Feb 05 2011
|
|
|
CROSSREFS
| Cf. A036117, A036118.
Sequence in context: A108565 A066005 A066600 * A008381 A083780 A101466
Adjacent sequences: A062113 A062114 A062115 * A062117 A062118 A062119
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Olivier Gerard (olivier.gerard(AT)gmail.com), Jun 06 2001
|
| |
|
|
