A053796 - OEIS

This site is supported by donations to The OEIS Foundation.

A053796

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 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,2`
	LINKS	`Index to sequences with 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+2x^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)`
	CROSSREFS	`Cf. A053793.` `Sequence in context: A108803 A050601 A101650 * A029391 A202149 A098356` `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 (sellersj(AT)math.psu.edu), Apr 08 2000`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:53 EST 2012. Contains 205860 sequences.