A009995 Numbers with digits in strictly decreasing order. From the Macaulay expansion of n.
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 20, 21, 30, 31, 32, 40, 41, 42, 43, 50, 51, 52, 53, 54, 60, 61, 62, 63, 64, 65, 70, 71, 72, 73, 74, 75, 76, 80, 81, 82, 83, 84, 85, 86, 87, 90, 91, 92, 93, 94, 95, 96, 97, 98, 210, 310, 320, 321, 410, 420, 421, 430, 431, 432, 510, 520, 521, 530
Offset: 1
Links
- Reinhard Zumkeller, Table of n, a(n) for n = 1..1023
- B. Sury, Macaulay Expansion, Amer. Math. Monthly 121 (2014), no. 4, 359--360. MR3183022. [See p. 359. - _N. J. A. Sloane_, Apr 05 2014]
- Eric Weisstein's World of Mathematics, Digit.
Programs
-
Haskell
import Data.Set (fromList, minView, insert) a009995 n = a009995_list !! n a009995_list = 0 : f (fromList [1..9]) where f s = case minView s of Nothing -> [] Just (m,s') -> m : f (foldl (flip insert) s' $ map (10*m +) [0..m `mod` 10 - 1]) -- Reinhard Zumkeller, Aug 10 2011
-
Mathematica
Sort@ Flatten@ Table[FromDigits /@ Subsets[ Range[9, 0, -1], {n}], {n, 10}] (* Zak Seidov, May 10 2006 *)
-
PARI
is(n)=fromdigits(vecsort(digits(n),,12))==n \\ Charles R Greathouse IV, Apr 16 2015
Comments