A053796 a(n) = (n^2+n) modulo 5.

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

Offset

0,2

Links

Table of n, a(n) for n=0..104.

Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,1).

Formula

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. (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 *)

Prog

(Magma) [(n^2+n) mod 5 : n in [0..100]]; // Wesley Ivan Hurt, Apr 20 2021

Crossrefs

Cf. A053793.

Sequence in context: A050601 A101650 A287411 * A029391 A058087 A240753

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