|
%I #29 Jul 17 2015 09:59:58
%S 540,2352,28224,82890,737856,1524096,1531152,3429216,17062920,
%T 22264200,23268600,49447728,104941200,162496048,197499456,267450144,
%U 502334784,619672032,2347826040,2942021520,4045874976,4302305280,9876226752
%N Numbers n = concat(s,t) such that n = sigma(s) * sigma(t), where sigma(x) is the sum of the divisors of x.
%e 540 = concat(5,40) -> sigma(5) = 6, sigma(40) = 90 and 6*90 = 540.
%e 2352 = concat(23,52) -> sigma(23) = 24, sigma(52) = 98 and 24*98 = 2352.
%e 28224 = concat(28,224) -> sigma(28) = 56, sigma(224) = 504 and 56*504 = 28222.
%e 82890 = concat(8,2890) -> sigma(8) = 15, sigma(2890) = 5526 and 15*5526 = 82890.
%p with(numtheory): P:=proc(q) local s, t, k, n;
%p for n from 1 to q do for k from 1 to ilog10(n) do s:=n mod 10^k; t:=trunc(n/10^k); if s*t>0 then if sigma(s)*sigma(t)=n
%p then print(n); break; fi; fi; od; od; end: P(10^6);
%t fQ[n_] := Block[{idn = IntegerDigits@ n, lng = Floor@ Log10@ n}, MemberQ[ Table[ DivisorSigma[1, FromDigits@ Take[ idn, {1, i}]] DivisorSigma[1, FromDigits@ Take[ idn, {i + 1, lng + 1}]], {i, lng}], n]]; k = 1; lst = {}; While[k < 1310000001, If[fQ@ k, AppendTo[ lst, k]; Print@ k]; k++] (* _Robert G. Wilson v_, Jan 19 2015 *)
%o (PARI) isok(n) = {len = #Str(n); for (k=1, len-1, na = n\10^k; nb = n % 10^k; if (nb && (n == sigma(na)*sigma(nb)), return (1)););} \\ _Michel Marcus_, Jan 15 2015
%Y Cf. A000203, A159000, A253825, A260144.
%K nonn,base,more
%O 1,1
%A _Paolo P. Lava_, Jan 15 2015
%E a(8) from _Michel Marcus_, Jan 15 2015
%E a(9)-a(17) from _Robert G. Wilson v_, Jan 18 2015
%E Missing a(14) and a(19)-a(23) from _Giovanni Resta_, Jul 17 2015
|
