|
Search: id:A070690
|
|
| |
|
| 0, 1, 3, 2, 4, 0, 1, 3, 2, 4, 0, 1, 3, 2, 4, 0, 1, 3, 2, 4, 0, 1, 3, 2, 4, 0, 1, 3, 2, 4, 0, 1, 3, 2, 4, 0, 1, 3, 2, 4, 0, 1, 3, 2, 4, 0, 1, 3, 2, 4, 0, 1, 3, 2, 4, 0, 1, 3, 2, 4, 0, 1, 3, 2, 4, 0, 1, 3, 2, 4, 0, 1, 3, 2, 4, 0, 1, 3, 2, 4, 0, 1, 3, 2, 4, 0, 1, 3, 2, 4, 0, 1, 3, 2, 4, 0, 1, 3, 2, 4, 0
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
The same as A070471. [Proof: (n^7-n^3) =0 (mod 5) can be shown to be correct by testing n=0 to 4. Alternatively n^7-n^3=n^3*(n^2+1)*(n+1)*(n-1) where n^3=0,1,3,2,4 (mod 5), n^2+1 = 1,2,0,0,2 (mod 5), n+1=1,2,3,4,0 (mod 5) and n-1=4,0,1,2,3 (mod 5), such that one of the factors is 0 (mod 5) for any n]. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 13 2009]
Equivalently: A070471 n^3 mod 5. [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 29 2009]
|
|
PROGRAM
|
(Other) sage: [power_mod(n, 7, 5 )for n in xrange(0, 101)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 29 2009]
|
|
CROSSREFS
|
Sequence in context: A143932 A118064 A070471 this_sequence A160387 A129237 A127099
Adjacent sequences: A070687 A070688 A070689 this_sequence A070691 A070692 A070693
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), May 13 2002
|
|
|
Search completed in 0.002 seconds
|
