OFFSET
1,2
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
PROG
(Haskell)
import Data.Set (singleton, deleteFindMin, insert)
a025635 n = a025635_list !! (n-1)
a025635_list = f $ singleton (1, 0, 0) where
f s = y : f (insert (9 * y, i + 1, j) $ insert (10 * y, i, j + 1) s')
where ((y, i, j), s') = deleteFindMin s
-- Reinhard Zumkeller, May 15 2015
(PARI) list(lim)=my(v=List(), N); for(n=0, logint(lim\=1, 10), N=10^n; while(N<=lim, listput(v, N); N*=9)); Set(v) \\ Charles R Greathouse IV, Jan 10 2018
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
STATUS
approved