|
%I #24 Oct 27 2023 22:10:43
%S 7,70,133,322,511,700,1015,1141,1204,1330,2023,2212,2401,3031,3220,
%T 4102,5110,7000,10024,10150,10213,10402,11032,11221,11410,12040,12103,
%U 13111,13300,15001,20041,20104,20230,21112,21301,22120,23002,24010
%N Multiples of 7 whose sum of digits is equal to 7.
%C Numbers are all 7 mod 63.
%H Alois P. Heinz, <a href="/A063416/b063416.txt">Table of n, a(n) for n = 1..10000</a> (first 700 terms from Harry J. Smith)
%e 133 = 19*7 and 1+3+3 = 7, so 133 is a term of this sequence.
%t Select[Range[7, 25000, 7], Plus @@ IntegerDigits[ # ] == 7 &]
%o (ARIBAS): var stk: stack; end; minarg := 0; maxarg := 5000; n := 7; for k := minarg to maxarg do m := k*n; s := itoa(m); for j := 0 to length(s) - 1 do stack_push(stk,atoi(s[j..j])); end; if sum(stack2array(stk)) = n then write(m," "); end; end;.
%o (PARI) forstep(m=0, 70000, 7, if(vecsum(digits(m))==7, print1(m, ", "))) \\ _Harry J. Smith_, Aug 20 2009
%Y Cf. A069521 to A069530, A069532, A069533, A069534, A069535, A069536, A069537, A052217, A063997, A069540, A062768.
%Y Row n=7 of A245062.
%K base,easy,nonn
%O 1,1
%A _Klaus Brockhaus_, Jul 20 2001
|
