login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A134301
Periodic sequence (0, 2, 6, 2, 0).
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, 0, 2, 6, 2, 0
OFFSET
0,2
COMMENTS
Also: twice the partial sums of A117444. - R. J. Mathar, Feb 01 2008
LINKS
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, Feb 01 2008
MATHEMATICA
PadRight[{}, 70, {0, 2, 6, 2, 0}] (* Harvey P. Dale, Mar 22 2012 *)
PROG
(PARI) a(n)=[0, 2, 6, 2, 0][n%5+1] \\ Charles R Greathouse IV, Jul 13 2016
CROSSREFS
Sequence in context: A117214 A185972 A182918 * A168294 A363737 A004544
KEYWORD
nonn,easy
AUTHOR
Franz Vrabec, Jan 30 2008
STATUS
approved