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

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

Offset

0,2

Comments

Luhn mod 10 check digits of terms in A093018.

Links

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000

John Kilgo, Using the Luhn Algorithm, DotNetJohn.com.

Webopedia, Luhn formula

Wikipedia, Luhn algorithm

Index entries for sequences related to decimal expansion of n

Formula

a(n) = A093018(n) - 10*n. - Reinhard Zumkeller, Nov 08 2014

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.

Prog

(Haskell)
a093019 = flip mod 10 . a093018  -- Reinhard Zumkeller, Nov 08 2014

Crossrefs

Cf. A093017-A093029.

Cf. A010879.

Sequence in context: A388741 A388107 A333198 * A388399 A388664 A388745

Adjacent sequences: A093016 A093017 A093018 * A093020 A093021 A093022

Keyword

easy,nonn,base

Author

Ray Chandler, Apr 03 2004

Status

approved