A061501 - OEIS

This site is supported by donations to The OEIS Foundation.

A061501

a(1) = 1, a(n+1) = (a(n) + n) mod 10.

1, 2, 4, 7, 1, 6, 2, 9, 7, 6, 6, 7, 9, 2, 6, 1, 7, 4, 2, 1, 1, 2, 4, 7, 1, 6, 2, 9, 7, 6, 6, 7, 9, 2, 6, 1, 7, 4, 2, 1, 1, 2, 4, 7, 1, 6, 2, 9, 7, 6, 6, 7, 9, 2, 6, 1, 7, 4, 2, 1, 1, 2, 4, 7, 1, 6, 2, 9, 7, 6, 6, 7, 9, 2, 6, 1, 7, 4, 2, 1, 1, 2, 4, 7, 1, 6, 2, 9, 7, 6, 6, 7, 9, 2, 6, 1, 7, 4, 2, 1, 1, 2, 4, 7, 1 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	COMMENTS	`First row of array shown below.` `a(n) = most significant digit of A062273(n).`
	FORMULA	`a(n) = (1 + n-th triangular number) mod 10.`
	EXAMPLE	`1 2 4 7 1 6 2 9 7 6 6 ...` `3 5 8 2 7 3 0 8 7 7 ...` `6 9 3 8 4 1 9 8 8 ...` `0 4 9 5 2 0 9 9 ...` `5 0 6 3 1 0 0 ...` `1 7 4 2 1 1 ...`
	CROSSREFS	`Equals A008954 + 1. Cf. A061352, A061353.` `Cf. A062273, A077577, A077578.` `Sequence in context: A097879 A180658 A019748 * A089349 A118424 A118429` `Adjacent sequences: A061498 A061499 A061500 * A061502 A061503 A061504`
	KEYWORD	`base,nonn,less`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 06 2001`
	EXTENSIONS	`Better description and more terms from Larry Reeves (larryr(AT)acm.org), May 08 2001`

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

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.