id:A061352 - OEIS Search Results

Search: id:A061352

Displaying 1-1 of 1 results found.

page 1

First row of array shown below.

+0
3

1, 2, 6, 7, 5, 6, 8, 9, 5, 6, 6, 7, 1, 2, 0, 1, 3, 4, 0, 1, 1, 2, 6, 7, 5, 6, 8, 9, 5, 6, 6, 7, 1, 2, 0, 1, 3, 4, 0, 1, 1, 2, 6, 7, 5, 6, 8, 9, 5, 6, 6, 7, 1, 2, 0, 1, 3, 4, 0, 1, 1, 2, 6, 7, 5, 6, 8, 9, 5, 6, 6, 7, 1, 2, 0, 1, 3, 4, 0, 1, 1, 2, 6, 7, 5, 6, 8, 9, 5, 6, 6, 7, 1, 2, 0, 1, 3, 4, 0, 1, 1, 2, 6, 7, 5 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Least significant digit of the n-th triangular number if n is odd.`
	FORMULA	`a(1)=1; if n odd, a(n+1)=(a(n)+1) mod 10; if n even, a(n+1)=(a(n)+2n) mod 10.` `a(2n-1) = n(2n-1)- 10Floor[n(2n-1)/10], a(2n) = n(2n+1)- 10Floor[n*(2n+1)/10] + 1.`
	EXAMPLE	`1 2 6 7 5 6 8 9 5 ...` `3 5 8 4 7 7 0 4 ...` `4 9 3 8 6 1 3 ...` `0 2 9 5 2 2 ...` `1 0 4 3 1 ...` `1 3 4 0 ...`
	CROSSREFS	`Cf. A061353.` `Sequence in context: A065488 A016591 A021793 this_sequence A039926 A035569 A140132` `Adjacent sequences: A061349 A061350 A061351 this_sequence A061353 A061354 A061355`
	KEYWORD	`nonn,easy`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 28 2001`
	EXTENSIONS	`More terms and formula from Larry Reeves (larryr(AT)acm.org), May 15 2001`

page 1

Search completed in 0.002 seconds

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.

AT&T Labs Research