|
Search: id:A070431
|
|
| |
|
| 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(m*n)=a(m)*a(n) mod 6; a(3*n+k)=a(3*n-k) for k<=3*n; a(n+6)=a(n). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 24 2009]
Equivalently n^6 mod 6. [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 06 2009]
|
|
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)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 23 2009]
|
|
PROGRAM
|
(Other) sage: [power_mod(n, 2, 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
|
A008959, A070435, A070438, A070442, A070452, A159852, A000290. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 24 2009]
Sequence in context: A007568 A091884 A048156 this_sequence A070511 A066340 A143505
Adjacent sequences: A070428 A070429 A070430 this_sequence A070432 A070433 A070434
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), May 12 2002
|
|
|
Search completed in 0.002 seconds
|
