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.

A218292 Multiples of 10 such that the sum of their digits is also a multiple of 10.

Original entry on oeis.org

190, 280, 370, 460, 550, 640, 730, 820, 910, 1090, 1180, 1270, 1360, 1450, 1540, 1630, 1720, 1810, 1900, 2080, 2170, 2260, 2350, 2440, 2530, 2620, 2710, 2800, 2990, 3070, 3160, 3250, 3340, 3430, 3520, 3610, 3700, 3890, 3980, 4060, 4150, 4240, 4330, 4420, 4510
Offset: 1

Views

Author

Bruno Berselli, Oct 25 2012

Keywords

Examples

			a(38) = 3890 is a multiple of 10, and 3+8+9+0=20 is also a multiple of 10.
		

Crossrefs

Cf. multiples of k with digit sum divisible by k: A008585 (k=3), A008591 (k=9), A062753 (k=4), A179082 (k=2), A216994 (k=7), A216995 (k=11), A216997 (k=8), A218290 (k=5), A218291 (k=6).

Programs

  • Magma
    [n: n in [10..4600 by 10] | IsZero(&+Intseq(n) mod 10)];
  • Mathematica
    Select[ Range[10, 4600, 10], Mod[ Total[ IntegerDigits[#]], 10] == 0 &] (* Jean-François Alcover, Oct 26 2012 *)

Formula

a(n) = 10*A094677(n).