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.

A218290 Multiples of 5 such that the sum of their digits is also a multiple of 5.

This page as a plain text file.
%I A218290 #21 Sep 08 2022 08:46:04
%S A218290 5,50,55,140,145,190,195,230,235,280,285,320,325,370,375,410,415,460,
%T A218290 465,500,505,550,555,640,645,690,695,730,735,780,785,820,825,870,875,
%U A218290 910,915,960,965,1040,1045,1090,1095,1130,1135,1180,1185,1220,1225,1270
%N A218290 Multiples of 5 such that the sum of their digits is also a multiple of 5.
%H A218290 Bruno Berselli, <a href="/A218290/b218290.txt">Table of n, a(n) for n = 1..1000</a>
%e A218290 145 is a multiple of 5, and its digits, 1, 4, 5, add up to 10, which is also a multiple of 5. [_Alonso del Arte_, Oct 27 2012]
%t A218290 Select[ Range[5, 1300, 5], Mod[ Total[ IntegerDigits[#]], 5] == 0 &] (* _Jean-François Alcover_, Oct 26 2012 *)
%o A218290 (Magma) [n: n in [5..1300 by 5] | IsZero(&+Intseq(n) mod 5)];
%Y A218290 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), A218291 (k = 6), A218292 (k = 10).
%K A218290 nonn,base,easy
%O A218290 1,1
%A A218290 _Bruno Berselli_, Oct 25 2012