|
%I #15 Aug 17 2021 06:27:02
%S 0,19,24,38,43,57,62,76,81,95,104,118,123,137,142,156,161,175,180,199,
%T 203,217,222,236,241,255,260,279,284,298,302,316,321,335,340,359,364,
%U 378,383,397,401,415,420,439,444,458,463,477,482,496,509,514,528,533
%N Indices of terms in A093019 with value 0.
%C Integers which require a following 0 to have a valid Luhn mod 10 check digit.
%H Reinhard Zumkeller, <a href="/A093020/b093020.txt">Table of n, a(n) for n = 1..10000</a>
%H John Kilgo, <a href="https://web.archive.org/web/20040627030859/http://www.dotnetjohn.com/articles/articleid97.aspx">Using the Luhn Algorithm</a>, DotNetJohn.com.
%H Webopedia, <a href="http://www.webopedia.com/TERM/L/Luhn_formula.html">Luhn formula</a>
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Luhn_algorithm">Luhn algorithm</a>
%H <a href="/index/De#decimal_expansion">Index entries for sequences related to decimal expansion of n</a>
%F A093019(a(n)) = 0. - _Reinhard Zumkeller_, Nov 08 2014
%e 19 is in the sequence because A093019(19)=0; 190 has a valid Luhn mod 10 check digit.
%o (Haskell)
%o a093020 n = a093020_list !! (n-1)
%o a093020_list = filter ((== 0) . a093019) [0..]
%o -- _Reinhard Zumkeller_, Nov 08 2014
%Y Cf. A093017-A093029.
%K easy,nonn,base
%O 1,2
%A _Ray Chandler_, Apr 03 2004
%E Offset changed by _Reinhard Zumkeller_, Nov 08 2014
|
