%I #19 Sep 08 2022 08:44:59

%S 8,17,26,35,44,53,62,71,80,107,116,125,134,143,152,161,170,206,215,

%T 224,233,242,251,260,305,314,323,332,341,350,404,413,422,431,440,503,

%U 512,521,530,602,611,620,701,710,800,1007,1016,1025,1034,1043,1052,1061

%N Numbers whose sum of digits is 8.

%C A007953(a(n)) = 8; number of repdigits = #{8,44,2222,1^8} = A242627(8) = 4. - _Reinhard Zumkeller_, Jul 17 2014

%H Michael S. Branicky, <a href="/A052222/b052222.txt">Table of n, a(n) for n = 1..12870</a> (all terms <= 9 digits; terms 1..1000 from Vincenzo Librandi)

%t Select[Range[1500], Total[IntegerDigits[#]] == 8 &] (* _Vincenzo Librandi_, Mar 08 2013 *)

%o (Magma) [n: n in [1..1500] | &+Intseq(n) eq 8 ]; // _Vincenzo Librandi_, Mar 08 2013

%o (Haskell)

%o a052222 n = a052222_list !! (n-1)

%o a052222_list = filter ((== 8) . a007953) [0..]

%o -- _Reinhard Zumkeller_, Jul 17 2014

%o (Python)

%o from sympy.utilities.iterables import multiset_permutations

%o def auptodigs(maxdigits):

%o alst = []

%o for d in range(1, maxdigits+1):

%o digset = "0"*(d-1) + "11111111222233445678"

%o for p in multiset_permutations(digset, d):

%o if p[0] != '0' and sum(map(int, p)) == 8:

%o alst.append(int("".join(p)))

%o return alst

%o print(auptodigs(4)) # _Michael S. Branicky_, Aug 17 2021

%Y Cf. A007953.

%Y Cf. A011557 (1), A052216 (2), A052217 (3), A052218 (4), A052219 (5), A052220 (6), A052221 (7), A052223 (9), A052224 (10), A166311 (11), A235151 (12), A143164 (13), A235225(14), A235226 (15), A235227 (16), A166370 (17), A235228 (18), A166459 (19), A235229 (20).

%Y Cf. A242614, A242627.

%K nonn,base,easy

%O 1,1

%A _Henry Bottomley_, Feb 01 2000

%E Offset changed from _Bruno Berselli_, Mar 07 2013