OFFSET
1,1
COMMENTS
Integers which require a following 9 to have a valid Luhn mod 10 check digit.
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
John Kilgo, Using the Luhn Algorithm, DotNetJohn.com.
Webopedia, Luhn formula
Wikipedia, Luhn algorithm
FORMULA
A093019(a(n)) = 9. - Reinhard Zumkeller, Nov 08 2014
EXAMPLE
10 is in the sequence because A093019(10)=9; 109 has a valid Luhn mod 10 check digit.
PROG
(Haskell)
a093029 n = a093029_list !! (n-1)
a093029_list = filter ((== 9) . a093019) [0..]
-- Reinhard Zumkeller, Nov 08 2014
CROSSREFS
KEYWORD
easy,nonn,base
AUTHOR
Ray Chandler, Apr 03 2004
EXTENSIONS
Offset changed by Reinhard Zumkeller, Nov 08 2014
STATUS
approved