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.

A283742 Numbers with digit sum 11 that are multiples of 11.

Original entry on oeis.org

209, 308, 407, 506, 605, 704, 803, 902, 2090, 3080, 4070, 5060, 6050, 7040, 8030, 9020, 10109, 10208, 10307, 10406, 10505, 10604, 10703, 10802, 10901, 20009, 20108, 20207, 20306, 20405, 20504, 20603, 20702, 20801, 20900, 30008, 30107, 30206, 30305, 30404
Offset: 1

Views

Author

Zak Seidov, Mar 15 2017

Keywords

Comments

Subsequence of A166311.
Numbers with digit sum 11 and even-numbered digits all 0. - Robert Israel, Mar 16 2017
Intersection of A008593 and A166311. - Michel Marcus, Mar 17 2017
If m is a term, so is 10*m. - Zak Seidov, Mar 17 2017

Examples

			a(1) = A166311(18) = 209 = 19*11,
a(40) = A166311(9881) = 30404 = 2764*11.
		

Crossrefs

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

Programs

  • Maple
    F:= proc(d,t) option remember;
    if d <= 1 then
      if t <= 9 then return [t*10^d] else return [] fi;
    fi;
    [seq(seq(j*10^d+s, s = procname(d-2, t-j)), j=0..min(9, t))]
    end proc:
    sort([op(F(4,11)),op(F(5,11))]); # Robert Israel, Mar 16 2017
  • Mathematica
    Reap[Do[If[11==Total[IntegerDigits[m=11*k]],Sow[m]],{k,3000}]][[2,1]]
    Select[Range[209,30404,11],11==Total[IntegerDigits[#]]&]