Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #23 Jun 30 2018 02:24:54
%S 4,8,40,44,48,80,84,88,112,116,152,156,192,196,220,224,228,260,264,
%T 268,332,336,372,376,400,404,408,440,444,448,480,484,488,512,516,552,
%U 556,592,596,620,624,628,660,664,668,732,736,772,776,800,804,808,840,844
%N Multiples of 4 whose sum of digits is also a multiple of 4.
%C Sequence is infinite since 4*10^k, k>=0 is a subsequence. - _Michel Marcus_, Jun 29 2018
%H Giovanni Resta, <a href="/A062753/b062753.txt">Table of n, a(n) for n = 1..10000</a> (first 1001 terms from Harry J. Smith)
%F Is a(n) ~ 16*n? - _David A. Corneth_, Jun 29 2018
%e 44 is a term of the sequence since 4 + 4 = 8 which is also a multiple of 4;
%e 112 is a term of the sequence since 1 + 1 + 2 = 4 and 4 is obviously a multiple of 4.
%e 8 is a multiple of 4. Numbers having digitsum 8 and are divisible by 4 below 1000 are: {8, 44, 80, 116, 152, 224, 260, 332, 404, 440, 512, 620, 800}. - _David A. Corneth_, Jun 29 2018
%t Select[4 Range[250], Mod[Plus @@ IntegerDigits@ #, 4] == 0 &] (* _Giovanni Resta_, Jun 29 2018 *)
%o (PARI) { forstep (a=4, 10^3, 4, if (sumdigits(a)%4 == 0, print1(a, ", "))) } \\ _Harry J. Smith_, Aug 10 2009
%Y Subsequence of A008586.
%K easy,nonn,base
%O 1,1
%A Lisa O Coulter (lisa_coulter(AT)my-deja.com), Jul 15 2001
%E More terms from Larry Reeves (larryr(AT)acm.org), Jul 24 2001
%E Offset set to 1 by _Giovanni Resta_, Jun 29 2018