|
|
A063416
|
|
Multiples of 7 whose sum of digits is equal to 7.
|
|
18
|
|
|
7, 70, 133, 322, 511, 700, 1015, 1141, 1204, 1330, 2023, 2212, 2401, 3031, 3220, 4102, 5110, 7000, 10024, 10150, 10213, 10402, 11032, 11221, 11410, 12040, 12103, 13111, 13300, 15001, 20041, 20104, 20230, 21112, 21301, 22120, 23002, 24010
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Numbers are all 7 mod 63.
|
|
LINKS
|
|
|
EXAMPLE
|
133 = 19*7 and 1+3+3 = 7, so 133 is a term of this sequence.
|
|
MATHEMATICA
|
Select[Range[7, 25000, 7], Plus @@ IntegerDigits[ # ] == 7 &]
|
|
PROG
|
(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; .
(PARI) forstep(m=0, 70000, 7, if(vecsum(digits(m))==7, print1(m, ", "))) \\ Harry J. Smith, Aug 20 2009
|
|
CROSSREFS
|
Cf. A069521 to A069530, A069532, A069533, A069534, A069535, A069536, A069537, A052217, A063997, A069540, A062768.
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|