
1, 15, 20, 39, 44, 58, 63, 77, 82, 96, 100, 119, 124, 138, 143, 157, 162, 176, 181, 195, 204, 218, 223, 237, 242, 256, 261, 275, 280, 299, 303, 317, 322, 336, 341, 355, 360, 379, 384, 398, 402, 416, 421, 435, 440, 459, 464, 478, 483, 497, 505, 510, 529, 534
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

Integers which require a following 8 to have a valid Luhn mod 10 check digit.


LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
John Kilgo, DotNetJohn.com, Using the Luhn Algorithm
Webopedia, Luhn formula
Wikipedia, Luhn_algorithm
Index entries for sequences related to decimal expansion of n


FORMULA

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


EXAMPLE

15 is in the sequence because A093019(15)=8; 158 has a valid Luhn mod 10 check digit.


PROG

(Haskell)
a093028 n = a093028_list !! (n1)
a093028_list = filter ((== 8) . a093019) [0..]
 Reinhard Zumkeller, Nov 08 2014


CROSSREFS

Cf. A093017A093029.
Sequence in context: A088494 A109659 A065148 * A105506 A120625 A038352
Adjacent sequences: A093025 A093026 A093027 * A093029 A093030 A093031


KEYWORD

easy,nonn,base


AUTHOR

Ray Chandler, Apr 03 2004


EXTENSIONS

Offset changed by Reinhard Zumkeller, Nov 08 2014


STATUS

approved

