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”).

A105332
a(n) = n*(n+1)/2 mod 8.
2
0, 1, 3, 6, 2, 7, 5, 4, 4, 5, 7, 2, 6, 3, 1, 0, 0, 1, 3, 6, 2, 7, 5, 4, 4, 5, 7, 2, 6, 3, 1, 0, 0, 1, 3, 6, 2, 7, 5, 4, 4, 5, 7, 2, 6, 3, 1, 0, 0, 1, 3, 6, 2, 7, 5, 4, 4, 5, 7, 2, 6, 3, 1, 0, 0, 1, 3, 6, 2, 7, 5, 4, 4, 5, 7, 2, 6, 3, 1, 0, 0, 1, 3, 6, 2, 7, 5, 4, 4, 5, 7, 2, 6, 3, 1, 0, 0, 1, 3, 6, 2, 7, 5, 4, 4
OFFSET
0,3
MATHEMATICA
Mod[Accumulate[Range[0, 110]], 8] (* Harvey P. Dale, Nov 03 2013 *)
CROSSREFS
Cf. A000217.
See A105198 for further information.
Sequence in context: A376559 A306640 A169751 * A274632 A186706 A169749
KEYWORD
nonn,easy
AUTHOR
Oscar Takeshita, May 01 2005
STATUS
approved