The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A249832 Characteristic function of numbers having a valid Luhn mod 10 check digit. 3
 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0 COMMENTS a(A093018(n)) = 1; a(A249830(n)) = 0; a(n) = if A093017(n) mod 10 = 0 then 1 else 0. LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..10000 Wikipedia, Luhn algorithm FORMULA a(n) = A000007(A093017(n) mod 10). PROG (Haskell) a249832 = (0 ^) . flip mod 10 . a093017 CROSSREFS Cf. A093017, A000007, A093018, A249830. Sequence in context: A000007 A240351 A358008 * A014041 A353675 A015868 Adjacent sequences: A249829 A249830 A249831 * A249833 A249834 A249835 KEYWORD nonn,base AUTHOR Reinhard Zumkeller, Nov 08 2014 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.

Last modified December 5 05:50 EST 2022. Contains 358578 sequences. (Running on oeis4.)