OFFSET
1,1
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..10000
MATHEMATICA
Select[Range@ 920, Total@ IntegerDigits[5 #] == 10 &] (* Michael De Vlieger, Dec 23 2016 *)
PROG
(PARI) select( is(n)=sumdigits(5*n)==10, [0..999])
(Python)
def ok(n): return sum(map(int, str(5*n))) == 10
print([k for k in range(921) if ok(k)]) # Michael S. Branicky, Nov 29 2021
CROSSREFS
Cf. A007953 (digital sum), A279772 (sumdigits(2n) = 4), A279773 (sumdigits(3n) = 6), A279774 (sumdigits(4n) = 8), A279776 (sumdigits(6n) = 12), A279770 (sumdigits(7n) = 14), A279768 (sumdigits(8n) = 16), A279769 (sumdigits(9n) = 18), A279777 (sumdigits(9n) = 27).
Digital sum of m*n equals m: A088404 = A069537/2, A088405 = A052217/3, A088406 = A063997/4, A088407 = A069540/5, A088408 = A062768/6, A088409 = A063416/7, A088410 = A069543/8.
Numbers with given digital sum: A011557 (1), A052216 (2), A052217 (3), A052218 (4), A052219 (5), A052220 (6), A052221 (7), A052222 (8), A052223 (9), A052224 (10), A166311 (11), A235151 (12), A143164 (13), A235225 (14), A235226 (15), A235227 (16), A166370 (17), A235228 (18), A166459 (19), A235229 (20).
KEYWORD
nonn,easy,base
AUTHOR
M. F. Hasler, Dec 23 2016
STATUS
approved