|
%I #21 Mar 17 2023 14:33:32
%S 0,4,8,13,17,22,26,31,35,39,40,44,48,53,57,62,66,71,75,79,80,84,88,93,
%T 97,103,107,112,116,121,125,129,130,134,138,143,147,152,156,161,165,
%U 169,170,174,178,183,187,192,196,202,206,211,215,219,220,224,228,233,237,242,246
%N Numbers whose digital sum is a multiple of 4.
%C a(1498) = 5999 is the smallest term that is congruent to 5 modulo 9.
%H Robert Israel, <a href="/A268620/b268620.txt">Table of n, a(n) for n = 1..10000</a>
%p select(t -> convert(convert(t,base,10),`+`) mod 4 = 0, [$1..1000]); # _Robert Israel_, Feb 09 2016
%t Select[Range[0, 250], IntegerQ[Total[IntegerDigits[#]]/4] &]
%o (Magma) [n: n in [0..250] | IsIntegral(&+Intseq(n)/4)];
%Y Cf. A007953, A061383 (supersequence).
%Y Cf. numbers whose digital sum is a multiple of k: A054683 (k=2), A008585 (k=3), this sequence (k=4), A227793 (k=5).
%Y Subsequences: A002278, A038446, A052218, A052222, A061387, A169967, A235151, A235227, A235229.
%K nonn,base
%O 1,2
%A _Bruno Berselli_, Feb 09 2016
|
