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 A037277 #23 Dec 31 2020 09:20:37
%S A037277 0,2,3,24,5,236,7,248,39,2510,11,234612,13,2714,3515,24816,17,236918,
%T A037277 19,2451020,3721,21122,23,234681224,525,21326,3927,2471428,29,
%U A037277 2356101530,31,2481632,31133,21734,5735,23469121836,37,21938,31339
%N A037277 Replace n with concatenation of its divisors >1.
%H A037277 Reinhard Zumkeller, <a href="/A037277/b037277.txt">Table of n, a(n) for n = 1..10000</a>
%t A037277 FromDigits[Flatten[IntegerDigits/@Rest[Divisors[#]]]]&/@Range[40] (* _Harvey P. Dale_, Nov 06 2011 *)
%o A037277 (Haskell)
%o A037277 a037277 1 = 0
%o A037277 a037277 n = read $ concat $ map show $ tail $ a027750_row n
%o A037277 -- _Reinhard Zumkeller_, May 01 2012, Feb 07 2011
%o A037277 (Python)
%o A037277 from sympy import divisors
%o A037277 def a(n):
%o A037277 divisors_gt1 = divisors(n)[1:]
%o A037277 if len(divisors_gt1) == 0: return 0
%o A037277 else: return int("".join(str(d) for d in divisors_gt1))
%o A037277 print([a(n) for n in range(1, 40)]) # _Michael S. Branicky_, Dec 31 2020
%Y A037277 Cf. A027750, A037284, A037278, A106708.
%K A037277 nonn,easy,base,nice
%O A037277 1,2
%A A037277 _N. J. A. Sloane_
%E A037277 More terms from _Erich Friedman_