|
Search: id:A135186
|
|
|
| A135186 |
|
Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=1. |
|
+0
17
|
|
| 4, 5, 7, 8, 27, 40, 50, 70, 81, 114, 133, 135, 152, 153, 171, 192, 195, 209, 222, 224, 225, 228, 230, 247, 261, 266, 280, 285, 308, 312, 320, 322, 336, 364, 370, 372, 375, 392, 399, 400, 405, 407, 408, 410, 423, 440, 444, 448, 465, 481, 500, 511, 512, 516, 518
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
The sequence is a subset of Niven (or Harshad) numbers A005349.
|
|
EXAMPLE
|
7 can be divided only for 7^1; 7^2=49 Sum_digits(49)=13 and 49 is not multiple of 13.
|
|
MAPLE
|
readlib(log10); P:=proc(n, m) local a, i, k, w, x, ok; for i from 1 by 1 to n do a:=simplify(log10(i)); if not (trunc(a)=a) then ok:=1; x:=1; while ok=1 do w:=0; k:=i^x; while k>0 do w:=w+k-(trunc(k/10)*10); k:=trunc(k/10); od; if trunc(i^x/w)=i^x/w then x:=x+1; else if x-1=m then print(i); fi; ok:=0; fi; od; fi; od; end: P(2000, 1);
|
|
CROSSREFS
|
Cf. A135187, A135188, A135189, A135190, A135191, A135192, A135193, A135194, A135195, A135196, A135197, A135198, A135199, A135200, A135201, A135202.
Sequence in context: A023629 A033164 A140076 this_sequence A011336 A094328 A081095
Adjacent sequences: A135183 A135184 A135185 this_sequence A135187 A135188 A135189
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Nov 22 2007
|
|
|
Search completed in 0.002 seconds
|
