A081286 For n<=11, a(n) = n mod 10. For even n>11, a(n) = (2a(n-1)+1) mod 10. For odd n>11, a(n) = (a(n-1)+a(i+1)) mod 10, where i is the largest integer < n-1 such that a(i)=a(n-1).

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 3, 7, 5, 1, 3, 0, 1, 4, 9, 9, 9, 8, 7, 2, 5, 6, 3, 3, 7, 9, 9, 8, 7, 6, 3, 0, 1, 5, 1, 6, 3, 3, 7, 3, 7, 0, 1, 7, 5, 6, 3, 0, 1, 8, 7, 2, 5, 1, 3, 3, 7, 9, 9, 8, 7, 6, 3, 0, 1, 4, 9, 7, 5, 6, 3, 3, 7, 2, 5, 1, 3, 0, 1, 4, 9, 6, 3, 3, 7, 9, 9, 8, 7, 6, 3, 0, 1, 5, 1, 6, 3, 3, 7

Offset

0,3

Comments

The sequence has period 60 starting with a(27).

Links

Ray Chandler, Table of n, a(n) for n = 0..1000

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

Crossrefs

Cf. A080867.

Sequence in context: A187844 A007954 A079475 * A080867 A095187 A218978

Adjacent sequences: A081283 A081284 A081285 * A081287 A081288 A081289

Keyword

nonn,easy

Author

Dean Hickerson, based on information supplied by Laurent Dorey and Antti Karttunen, Mar 15 2003.

Status

approved