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.

A268620 Numbers whose digital sum is a multiple of 4.

Original entry on oeis.org

0, 4, 8, 13, 17, 22, 26, 31, 35, 39, 40, 44, 48, 53, 57, 62, 66, 71, 75, 79, 80, 84, 88, 93, 97, 103, 107, 112, 116, 121, 125, 129, 130, 134, 138, 143, 147, 152, 156, 161, 165, 169, 170, 174, 178, 183, 187, 192, 196, 202, 206, 211, 215, 219, 220, 224, 228, 233, 237, 242, 246
Offset: 1

Views

Author

Bruno Berselli, Feb 09 2016

Keywords

Comments

a(1498) = 5999 is the smallest term that is congruent to 5 modulo 9.

Crossrefs

Cf. A007953, A061383 (supersequence).
Cf. numbers whose digital sum is a multiple of k: A054683 (k=2), A008585 (k=3), this sequence (k=4), A227793 (k=5).

Programs

  • Magma
    [n: n in [0..250] | IsIntegral(&+Intseq(n)/4)];
  • Maple
    select(t -> convert(convert(t,base,10),`+`) mod 4 = 0, [$1..1000]); # Robert Israel, Feb 09 2016
  • Mathematica
    Select[Range[0, 250], IntegerQ[Total[IntegerDigits[#]]/4] &]