id:A093019 - OEIS Search Results

Search: id:A093019

Displaying 1-1 of 1 results found.

page 1

a(n) = A093018(n) mod 10.

+0
11

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

	OFFSET	`0,2`
	COMMENT	`Luhn mod 10 check digits of terms in A093018.`
	LINKS	`Webopedia, Luhn formula` `John Kilgo, DotNetJohn.com, Using the Luhn Algorithm`
	EXAMPLE	`a(1)=8 because A093018(1) mod 10 = 18 mod 10 = 8.` `a(5)=9 because A093018(5) mod 10 = 59 mod 10 = 9.`
	CROSSREFS	`Cf. A093017-A093029.` `Adjacent sequences: A093016 A093017 A093018 this_sequence A093020 A093021 A093022` `Sequence in context: A085666 A084895 A059631 this_sequence A008569 A021906 A011329`
	KEYWORD	`easy,nonn,base`
	AUTHOR	`Ray Chandler (rayjchandler(AT)sbcglobal.net), Apr 3 2004`

page 1

Search completed in 0.002 seconds

Last modified October 16 00:31 EDT 2008. Contains 145098 sequences.

AT&T Labs Research