|
Search: id:A070511
|
|
| |
|
| 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; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
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]
|
|
PROGRAM
|
(Other) sage: [power_mod(n, 4, 6)for n in xrange(0, 101)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 30 2009]
(Other) sage: [power_mod(n, 6, 6)for n in xrange(0, 101)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 06 2009]
|
|
CROSSREFS
|
Sequence in context: A091884 A048156 A070431 this_sequence A066340 A143505 A161882
Adjacent sequences: A070508 A070509 A070510 this_sequence A070512 A070513 A070514
|
|
KEYWORD
|
nonn,new
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), May 13 2002
|
|
|
Search completed in 0.002 seconds
|
