This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A279771 #10 Dec 23 2016 21:41:56 %S A279771 19,28,37,46,55,64,73,82,190,280,370,460,550,640,730,820,919,928,937, %T A279771 946,955,964,973,982,991,1819,1828,1837,1846,1855,1864,1873,1882,1891, %U A279771 1900,2728,2737,2746,2755,2764,2773,2782,2791,2800,3637,3646,3655,3664 %N A279771 Numbers n such that the sum of digits of 11n equals 11. %C A279771 Inspired by A088404 = A069537/2 through A088410 = A069543/8. %t A279771 Select[Range@ 3664, Total@IntegerDigits[11 #] == 11 &] (* _Michael De Vlieger_, Dec 23 2016 *) %o A279771 (PARI) is(n)=sumdigits(11*n)==11 %Y A279771 Cf. A007953 (digital sum), 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. %Y A279771 Cf. A005349 (Niven or Harshad numbers), A245062 (arranged in rows by digit sums). %Y A279771 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). %Y A279771 Cf. A279772 (sumdigits(2n) = 4), A279773 (sumdigits(3n) = 6), A279774 (sumdigits(4n) = 8), A279775 (sumdigits(5n) = 10), A279776 (sumdigits(6n) = 12), A279770 (sumdigits(7n) = 14), A279768 (sumdigits(8n) = 16), A279769 (sumdigits(9n) = 18), A279777 (sumdigits(9n) = 27). %K A279771 nonn,base,easy %O A279771 1,1 %A A279771 _M. F. Hasler_, Dec 23 2016