This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A216995 Multiples of 11 such that the digit sum is a multiple of 11. 9
 209, 308, 407, 506, 605, 704, 803, 902, 2090, 2299, 2398, 2497, 2596, 2695, 2794, 2893, 2992, 3080, 3289, 3388, 3487, 3586, 3685, 3784, 3883, 3982, 4070, 4279, 4378, 4477, 4576, 4675, 4774, 4873, 4972, 5060, 5269, 5368, 5467, 5566, 5665, 5764, 5863, 5962, 6050 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Nothing between 1000 and 2000. Also, there are no a(n) from 10902 to 12198 (this interval contains 117 multiples of 11). [Bruno Berselli, Oct 26 2012] LINKS Bruno Berselli, Table of n, a(n) for n = 1..1000 EXAMPLE 3487 = 11*317 and 3+4+8+7 = 22 = 11*2. MATHEMATICA Select[11*Range[1000], Mod[Total[IntegerDigits[#]], 11] == 0 &] (* T. D. Noe, Sep 24 2012 *) PROG (JavaScript) function sumarray(arr) { t=0; for (i=0; i

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 22 09:56 EDT 2019. Contains 328315 sequences. (Running on oeis4.)