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!)
 A053796 n^2+n modulo 5. 2
 0, 2, 1, 2, 0, 0, 2, 1, 2, 0, 0, 2, 1, 2, 0, 0, 2, 1, 2, 0, 0, 2, 1, 2, 0, 0, 2, 1, 2, 0, 0, 2, 1, 2, 0, 0, 2, 1, 2, 0, 0, 2, 1, 2, 0, 0, 2, 1, 2, 0, 0, 2, 1, 2, 0, 0, 2, 1, 2, 0, 0, 2, 1, 2, 0, 0, 2, 1, 2, 0, 0, 2, 1, 2, 0, 0, 2, 1, 2, 0, 0, 2, 1, 2, 0, 0, 2, 1, 2, 0, 0, 2, 1, 2, 0, 0, 2, 1, 2, 0, 0, 2, 1, 2, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,1). FORMULA Contribution from Bruno Berselli, Dec 02 2010: (Start) G.f.:  x*(2+x+2*x^2)/(1-x^5); a(n) = a(n-5) for n>4. a(n) = ((n mod 5)+5*(n+1 mod 5)-(n+2 mod 5)+3*(n+3 mod 5)-3*(n+4 mod 5))/10 (see Paolo P. Lava in A070341). (End) MATHEMATICA Table[Mod[n^2+n, 5], {n, 0, 110}] (* or *) PadRight[{}, 120, {0, 2, 1, 2, 0}] (* Harvey P. Dale, Sep 12 2017 *) CROSSREFS Cf. A053793. Sequence in context: A050601 A101650 A287411 * A029391 A240753 A202149 Adjacent sequences:  A053793 A053794 A053795 * A053797 A053798 A053799 KEYWORD nonn,easy AUTHOR Stuart M. Ellerstein (ellerstein(AT)aol.com), Mar 27 2000 EXTENSIONS More terms from James A. Sellers, Apr 08 2000 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 April 3 00:35 EDT 2020. Contains 333195 sequences. (Running on oeis4.)