A096320 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

Other ways to Give

A096320

a(n) = (n^2+n+4)/2, modulo 10.

2, 3, 5, 8, 2, 7, 3, 0, 8, 7, 7, 8, 0, 3, 7, 2, 8, 5, 3, 2, 2, 3, 5, 8, 2, 7, 3, 0, 8, 7, 7, 8, 0, 3, 7, 2, 8, 5, 3, 2, 2, 3, 5, 8, 2, 7, 3, 0, 8, 7, 7, 8, 0, 3, 7, 2, 8, 5, 3, 2, 2, 3, 5, 8, 2, 7, 3, 0, 8, 7, 7, 8, 0, 3, 7, 2, 8, 5, 3, 2, 2, 3, 5, 8, 2, 7, 3, 0, 8, 7, 7, 8, 0, 3, 7, 2, 8, 5, 3, 2, 2, 3, 5, 8, 2

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,1

COMMENTS

This periodic sequence equals A008954(n)+2 modulo 10 and also A061501(n+1)+1 modulo 10.

LINKS

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

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

FORMULA

a(0)=2, a(1)=3, a(2)=5, a(3)=8, a(4)=2, a(5)=7, a(6)=3, a(7)=0, a(8)=8, a(9)=7, a(10)=7, a(11)=8, a(12)=0, a(13)=3, a(14)=7, a(n)=a(n-5)-a(n-10)+ a(n-15). - Harvey P. Dale, Nov 16 2012

MATHEMATICA

Table[Mod[(n^2+n+4)/2, 10], {n, 0, 110}] (* or *) LinearRecurrence[ {0, 0, 0, 0, 1, 0, 0, 0, 0, -1, 0, 0, 0, 0, 1}, {2, 3, 5, 8, 2, 7, 3, 0, 8, 7, 7, 8, 0, 3, 7}, 110] (* Harvey P. Dale, Nov 16 2012 *)

CROSSREFS

Cf. A008954, A061501.

Sequence in context: A111301 A247193 A362358 * A105955 A003893 A152303

Adjacent sequences: A096317 A096318 A096319 * A096321 A096322 A096323

KEYWORD

nonn,easy,less

AUTHOR

Cino Hilliard, Aug 02 2004

EXTENSIONS

Edited by Don Reble, Apr 16 2007

STATUS

approved