id:A065881 - OEIS Search Results

Search: id:A065881

Displaying 1-1 of 1 results found.

page 1

Ultimate modulo 10: right-hand nonzero digit of n.

+0
3

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

	OFFSET	`1,2`
	LINKS	`Index entries for sequences related to final digits of numbers`
	FORMULA	`If n mod 10 = 0 then a(n) = a(n/10), otherwise a(n) = n mod 10.`
	EXAMPLE	`a(3)=3, a(23)=3, a(30)=3, a(12300)=3.`
	CROSSREFS	`In base 2 this is A000012, base 3 A060236, and base 4 A065882. For n<=100 this sequence is also "Remove final zeros from n" which in bases 2, 3 and 4 produces A000265, A038502, and A065883. Cf. A010879.` `Sequence in context: A134777 A004427 A113230 this_sequence A133048 A054055 A067456` `Adjacent sequences: A065878 A065879 A065880 this_sequence A065882 A065883 A065884`
	KEYWORD	`base,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Nov 26 2001`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research