This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A239562 #21 Oct 19 2014 16:03:06 %S A239562 39,119,253,581,1875,2077,14477,15879,17823,100637,160529,232477, %T A239562 251189,286437,506587,552739,605729,806179,1170695,3272257,3295289, %U A239562 4085129,4201441,4657133,4844701,5625173,8106509,12430289,23943721,33857009,41782973,64012513 %N A239562 Numbers n such that n = concatenate(a, b) and sigma(a) + sigma(b) = sigma(n) - n. %H A239562 Giovanni Resta, <a href="/A239562/b239562.txt">Table of n, a(n) for n = 1..65</a> (terms < 3*10^9) %e A239562 For n = 232477 we can consider 232477 = 2 U 32477 and sigma(232477) = 265696, sigma(2) = 3, sigma(32477) = 33216 and 265696 - 232477 = 33219 = 3 + 33216. %e A239562 For n = 251189 we can consider 251189 = 25 U 1189 and sigma(251189) = 252480, sigma(25) = 31, sigma(1189) = 1260 and 252480 - 251189 = 1291 = 31 + 1260. %p A239562 with(numtheory); %p A239562 T:=proc(t) local w,x,y; x:=t; y:=0; while x>0 do x:=trunc(x/10); y:=y+1; od; end: %p A239562 P:=proc(q) local a,b,c,d,i,n; for n from 1 to q do a:=sigma(n); b:=T(n); %p A239562 for i from 1 to b-1 do c:=trunc(n/10^i); d:=n-c*10^i; %p A239562 if sigma(c)+sigma(d)=a-n then print(n); break; fi; od; od; end: P(10^9); %Y A239562 Cf. A000203, A239563. %K A239562 nonn,base,hard %O A239562 1,1 %A A239562 _Paolo P. Lava_, Mar 21 2014 %E A239562 a(19)-a(32) from _Giovanni Resta_, Mar 21 2014