The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Index entries for linear recurrences with constant coefficients, signature (1,-1,1,-1,1,-1,1,-1,1,-1,1,-1,1,-1,1). MATHEMATICA Mod[Accumulate[Range[0, 110]], 8] (* Harvey P. Dale, Nov 03 2013 *) CROSSREFS See A105198 for further information. Sequence in context: A046901 A306640 A169751 * A274632 A186706 A169749 Adjacent sequences:  A105329 A105330 A105331 * A105333 A105334 A105335 KEYWORD nonn,easy AUTHOR Oscar Takeshita, May 01 2005 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 25 06:32 EDT 2020. Contains 337335 sequences. (Running on oeis4.)