[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
login
A052222
Numbers whose sum of digits is 8.
35
8, 17, 26, 35, 44, 53, 62, 71, 80, 107, 116, 125, 134, 143, 152, 161, 170, 206, 215, 224, 233, 242, 251, 260, 305, 314, 323, 332, 341, 350, 404, 413, 422, 431, 440, 503, 512, 521, 530, 602, 611, 620, 701, 710, 800, 1007, 1016, 1025, 1034, 1043, 1052, 1061
OFFSET
1,1
COMMENTS
A007953(a(n)) = 8; number of repdigits = #{8,44,2222,1^8} = A242627(8) = 4. - Reinhard Zumkeller, Jul 17 2014
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..12870 (all terms <= 9 digits; terms 1..1000 from Vincenzo Librandi)
MATHEMATICA
Select[Range[1500], Total[IntegerDigits[#]] == 8 &] (* Vincenzo Librandi, Mar 08 2013 *)
PROG
(Magma) [n: n in [1..1500] | &+Intseq(n) eq 8 ]; // Vincenzo Librandi, Mar 08 2013
(Haskell)
a052222 n = a052222_list !! (n-1)
a052222_list = filter ((== 8) . a007953) [0..]
-- Reinhard Zumkeller, Jul 17 2014
(Python)
from sympy.utilities.iterables import multiset_permutations
def auptodigs(maxdigits):
alst = []
for d in range(1, maxdigits+1):
digset = "0"*(d-1) + "11111111222233445678"
for p in multiset_permutations(digset, d):
if p[0] != '0' and sum(map(int, p)) == 8:
alst.append(int("".join(p)))
return alst
print(auptodigs(4)) # Michael S. Branicky, Aug 17 2021
CROSSREFS
Cf. A007953.
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).
Sequence in context: A224829 A273188 A017257 * A341009 A044441 A189381
KEYWORD
nonn,base,easy
AUTHOR
Henry Bottomley, Feb 01 2000
EXTENSIONS
Offset changed from Bruno Berselli, Mar 07 2013
STATUS
approved