|
| |
| |
|
|
|
0, 1, 4, 3, 4, 1, 0, 1, 4, 3, 4, 1, 0, 1, 4, 3, 4, 1, 0, 1, 4, 3, 4, 1, 0, 1, 4, 3, 4, 1, 0, 1, 4, 3, 4, 1, 0, 1, 4, 3, 4, 1, 0, 1, 4, 3, 4, 1, 0, 1, 4, 3, 4, 1, 0, 1, 4, 3, 4, 1, 0, 1, 4, 3, 4, 1, 0, 1, 4, 3, 4, 1, 0, 1, 4, 3, 4, 1, 0, 1, 4, 3, 4, 1, 0, 1, 4, 3, 4, 1, 0, 1, 4, 3, 4, 1, 0, 1, 4, 3, 4
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| a(n)=A070431(n) [Proof: n^4-n^2 =0 (mod 6) is shown explicitly for n=0 to 5, then the induction n->n+6 for the 4th order polynomial followed by binomial expansion of (n+6)^k concludes that the zero (mod 6) is periodically extended to the other integers.] [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 23 2009]
Equivalently n^6 mod 6. [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,0,1)
|
|
|
FORMULA
| G.f. -x*(1+4*x+3*x^2+4*x^3+x^4) / ( (x-1)*(1+x)*(1+x+x^2)*(x^2-x+1) ). - R. J. Mathar, Mar 14 2011
|
|
|
MATHEMATICA
| Table[Mod[n^4, 6], {n, 0, 200}] (* From Vladimir Joseph Stephan Orlovsky, Apr 21 2011 *)
|
|
|
PROG
| (Other) sage: [power_mod(n, 4, 6)for n in xrange(0, 101)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 30 2009]
|
|
|
CROSSREFS
| Cf. A070430, A070431.
Sequence in context: A091884 A048156 A070431 * A066340 A195597 A143505
Adjacent sequences: A070508 A070509 A070510 * A070512 A070513 A070514
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), May 13 2002
|
| |
|
|
