|
| |
| |
|
|
|
0, 1, 4, 4, 1, 0, 1, 4, 4, 1, 0, 1, 4, 4, 1, 0, 1, 4, 4, 1, 0, 1, 4, 4, 1, 0, 1, 4, 4, 1, 0, 1, 4, 4, 1, 0, 1, 4, 4, 1, 0, 1, 4, 4, 1, 0, 1, 4, 4, 1, 0, 1, 4, 4, 1, 0, 1, 4, 4, 1, 0, 1, 4, 4, 1, 0, 1, 4, 4, 1, 0, 1, 4, 4, 1, 0, 1, 4, 4, 1, 0, 1, 4, 4, 1, 0, 1, 4, 4, 1, 0, 1, 4, 4, 1, 0, 1, 4, 4, 1, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| Equivalently n^6 mod 5. [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 06 2009]
|
|
|
LINKS
| Index to sequences with linear recurrences with constant coefficients, signature (0,0,0,0,1). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 20 2010]
|
|
|
FORMULA
| a(n)= +a(n-5). G.f.: -x*(1+x)*(x^2+3*x+1) / ( (x-1)*(1+x+x^2+x^3+x^4) ). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 20 2010]
|
|
|
MATHEMATICA
| Table[Mod[n^2, 5], {n, 0, 200}] (* From Vladimir Joseph Stephan Orlovsky, Apr 21 2011 *)
|
|
|
PROG
| (Other) 1.)sage: [power_mod(n, 2, 5)for n in xrange(0, 101)] # 2.)sage: [power_mod(n, 6, 5)for n in xrange(0, 101)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 06 2009]
|
|
|
CROSSREFS
| Cf. A070431, A053879, A070432.
Sequence in context: A102412 A185057 A048152 * A163353 A164612 A180401
Adjacent sequences: A070427 A070428 A070429 * A070431 A070432 A070433
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), May 12 2002
|
| |
|
|
