id:A061501 - OEIS Search Results

Search: id:A061501

Displaying 1-1 of 1 results found.

page 1

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

+0
3

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; listen)

	OFFSET	`1,2`
	COMMENT	`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: A118946 A097879 A019748 this_sequence A089349 A118424 A118429` `Adjacent sequences: A061498 A061499 A061500 this_sequence 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`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research