|
Search: id:A134301
|
|
|
| A134301 |
|
Periodic sequence (0, 2, 6, 2, 0). |
|
+0
1
|
|
| 0, 2, 6, 2, 0, 0, 2, 6, 2, 0, 0, 2, 6, 2, 0, 0, 2, 6, 2, 0, 0, 2, 6, 2, 0, 0, 2, 6, 2, 0, 0, 2, 6, 2, 0, 0, 2, 6, 2, 0, 0, 2, 6, 2, 0, 0, 2, 6, 2, 0, 0, 2, 6, 2, 0, 0, 2, 6, 2, 0, 0, 2, 6, 2, 0
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Also: twice the partial sums of A117444. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 01 2008
|
|
REFERENCES
|
Rozsa Peter, Leon Harkleroad, Mathematics is Beautiful, Math. Intellig., 12 (No. 1, 1990), 58-64.
|
|
FORMULA
|
a(n) = n(n+1) mod 10
O.g.f.: -2/(x-1)+(2*x^3+2*x^2-2*x-2)/(1+x+x^2+x^3+x^4). a(n)=a(n-5). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 01 2008
a(n)=(1/5)*{(n mod 5)+3*[(n+1) mod 5]+5*[(n+2) mod 5]-3*[(n+3) mod 5]-[(n+4) mod 5]}, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Feb 05 2008
|
|
CROSSREFS
|
Adjacent sequences: A134298 A134299 A134300 this_sequence A134302 A134303 A134304
Sequence in context: A132181 A027642 A117214 this_sequence A004544 A010590 A049061
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Franz Vrabec (franz.vrabec(AT)planetuniqa.at), Jan 30 2008
|
|
|
Search completed in 0.002 seconds
|
