The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093019 a(n) = A093018(n) mod 10. 13
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; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Luhn mod 10 check digits of terms in A093018.
LINKS
John Kilgo, Using the Luhn Algorithm, DotNetJohn.com.
Webopedia, Luhn formula
Wikipedia, Luhn algorithm
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. A010879.
Sequence in context: A177154 A059631 A333198 * A175573 A296494 A261027
KEYWORD
easy,nonn,base
AUTHOR
Ray Chandler, Apr 03 2004
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 14 05:27 EDT 2024. Contains 373393 sequences. (Running on oeis4.)