|
%I #8 Feb 22 2013 21:38:13
%S 1,2,3,4,5,6,7,8,9,11,12,22,24,33,36,44,48,55,66,77,88,99,108,109,111,
%T 112,119,122,123,124,125,148,152,153,159,167,168,174,185,186,197,198,
%U 216,217,218,219,222,224,244,246,248,251,261,263,285,294,296,324,326
%N Numbers that can be written in decimal representation as sum of distinct repdigits of its digits.
%C A131364(a(n)) > 0; complement of A131365.
%H R. Zumkeller, <a href="/A131366/b131366.txt">Table of n, a(n) for n = 1..1000</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Repdigit.html">Repdigit</a>
%o (Haskell)
%o import Data.List (findIndices)
%o a131366 n = a131366_list !! (n-1)
%o a131366_list = tail $ findIndices (> 0) a131364_list
%o -- _Reinhard Zumkeller_, Dec 10 2011
%Y Cf. A061276.
%K nonn,base
%O 1,2
%A _Reinhard Zumkeller_, Jul 03 2007
|
