OFFSET
1,2
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..100000
Wikipedia, Luhn algorithm
PROG
(Haskell)
import Data.List (sortBy); import Data.Function (on)
a249855 n = a249855_list !! (n-1)
a249855_list = sortBy (compare `on` f) $ takeWhile (<= 10^6) a093018_list
where f x = (head $ reverse ds, ds) where ds = show x
CROSSREFS
KEYWORD
AUTHOR
Reinhard Zumkeller, Nov 08 2014
STATUS
approved