id:A081286 - OEIS Search Results

Search: id:A081286

Displaying 1-1 of 1 results found.

page 1

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

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 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`The sequence has period 60 starting with a(27).`
	CROSSREFS	`Cf. A080867.` `Adjacent sequences: A081283 A081284 A081285 this_sequence A081287 A081288 A081289` `Sequence in context: A128212 A007954 A079475 this_sequence A080867 A095187 A141022`
	KEYWORD	`nonn,easy`
	AUTHOR	`Dean Hickerson (dean(AT)math.ucdavis.edu), based on information supplied by Laurent Dorey and Antti Karttunen, Mar 15 2003.`

page 1

Search completed in 0.002 seconds

Last modified October 11 09:12 EDT 2008. Contains 144832 sequences.

AT&T Labs Research