cp's OEIS Frontend

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.

A216995 Multiples of 11 whose digit sum is a multiple of 11.

Original entry on oeis.org

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
Offset: 1

Views

Author

Jon Perry, Sep 22 2012

Keywords

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]

Examples

			3487 = 11*317 and 3+4+8+7 = 22 = 11*2.
		

Crossrefs

Cf. A008593 (multiples of 11), A166311 (digit sum multiple of 11).

Programs

  • JavaScript
    function sumarray(arr) {
    t=0;
    for (i=0;i
    				
  • Mathematica
    Select[11*Range[1000], Mod[Total[IntegerDigits[#]], 11] == 0 &] (* T. D. Noe, Sep 24 2012 *)
  • Python
    def sd(n): return sum(map(int, str(n)))
    def ok(n): return n%11 == 0 and sd(n)%11 == 0
    print(list(filter(ok, range(1, 6051)))) # Michael S. Branicky, Jul 11 2021