|
Search: id:A131069
|
|
|
| A131069 |
|
Numbers n such that n = sum_digits(a)^sum_digits(b) = a+b, with a and b positive integers. |
|
+0
2
|
|
| 1, 4, 25, 64, 121, 125, 196, 216, 289, 343, 400, 2744, 3375, 4096, 12167, 13824, 15625, 32768
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Obviously n must be a perfect power. - Robert G. Wilson v.
|
|
EXAMPLE
|
121 = 119 + 2 -> Sum_digits(119)=11; Sum_digits(2)=2 -> 11^2 = 121.
2744 = 2741 + 3 -> Sum_digits(2741)=14; Sum_digits(3)=3 -> 14^3 = 2744
Also 2744 = 2732+12 = 2723+21 = 2714+30 = 2642+102 = 2633+111 = 2624+120 = 2543+201 = 2534+210 = 2444+300 = 2100+644 = 2010+734 = 2001+743 = 1742+1002 = 1733+1011 = 1724+1020 = 1643+1101 = 1634+1110 = 1544+1200
|
|
MAPLE
|
P:=proc(n) local a, i, j, k, x, w; for i from 1 by 1 to n do if (i mod 1000)=0 then print("sono a:", i); fi; if (trunc(i/2))*2=i then a:=i/2+1; else a:=(i+1)/2; fi; for j from 1 to a do w:=0; k:=i-j+1; while k>0 do w:=w+k-(trunc(k/10)*10); k:=trunc(k/10); od; x:=0; k:=j-1; while k>0 do x:=x+k-(trunc(k/10)*10); k:=trunc(k/10); od; if ((w^x=i) or (x^w=i)) then print(i, i-j+1, j-1); fi od; od; end: P(10000);
|
|
MATHEMATICA
|
fQ[n_] := Block[{k = 0}, While[j = n - k; k < n && Plus @@ IntegerDigits[j]^Plus @@ IntegerDigits[k] != n, k++ ]; k != n]; lst = {}; Do[ If[GCD @@ Last /@ FactorInteger@n > 1 && fQ@n, Print@n; AppendTo[lst, n]], {n, 1934880}]; lst (* Robert G. Wilson v *)
|
|
CROSSREFS
|
Cf. A131070, A001597.
Sequence in context: A042177 A089767 A135784 this_sequence A016790 A065733 A077205
Adjacent sequences: A131066 A131067 A131068 this_sequence A131070 A131071 A131072
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Jun 13 2007, Jun 15 2007
|
|
EXTENSIONS
|
a(15)-a(18) from R. J. Mathar (mathar(AT)strw.leidenuniv.nl) and Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 14 2007
|
|
|
Search completed in 0.002 seconds
|
