
0, 19, 24, 38, 43, 57, 62, 76, 81, 95, 104, 118, 123, 137, 142, 156, 161, 175, 180, 199, 203, 217, 222, 236, 241, 255, 260, 279, 284, 298, 302, 316, 321, 335, 340, 359, 364, 378, 383, 397, 401, 415, 420, 439, 444, 458, 463, 477, 482, 496, 509, 514, 528, 533
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

Integers which require a following 0 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
Index entries for sequences related to decimal expansion of n


FORMULA

A093019(a(n)) = 0.  Reinhard Zumkeller, Nov 08 2014


EXAMPLE

19 is in the sequence because A093019(19)=0; 190 has a valid Luhn mod 10 check digit.


PROG

(Haskell)
a093020 n = a093020_list !! (n1)
a093020_list = filter ((== 0) . a093019) [0..]
 Reinhard Zumkeller, Nov 08 2014


CROSSREFS

Cf. A093017A093029.
Sequence in context: A160077 A076353 A297575 * A105504 A151900 A087951
Adjacent sequences: A093017 A093018 A093019 * A093021 A093022 A093023


KEYWORD

easy,nonn,base


AUTHOR

Ray Chandler, Apr 03 2004


EXTENSIONS

Offset changed by Reinhard Zumkeller, Nov 08 2014


STATUS

approved

