|
Search: id:A034087
|
|
|
| A034087 |
|
Numbers divisible by the sum of the squares of their digits. |
|
+0
2
|
|
| 1, 10, 20, 50, 100, 110, 111, 120, 130, 133, 200, 210, 240, 267, 298, 310, 315, 360, 372, 376, 400, 420, 480, 500, 532, 550, 630, 803, 917, 973, 1000, 1010, 1011, 1020, 1030, 1071, 1100, 1101, 1110, 1134, 1148, 1200, 1211, 1222, 1290, 1300, 1302, 1316
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
A003132[a(n)] | a(n). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 25 2007
|
|
MAPLE
|
A003132 := proc(n) local dec ; dec := convert(n, base, 10) ; add( op(i, dec)^2, i=1..nops(dec)) ; end: isA034087 := proc(n) if n mod A003132(n) = 0 then true ; else false ; fi ; end: for n from 1 to 1800 do if isA034087(n) then printf("%d ", n) ; fi ; od ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 25 2007
|
|
CROSSREFS
|
Sequence in context: A048063 A007927 A072081 this_sequence A117562 A115045 A067192
Adjacent sequences: A034084 A034085 A034086 this_sequence A034088 A034089 A034090
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Erich Friedman (erich.friedman(AT)stetson.edu)
|
|
|
Search completed in 0.002 seconds
|
