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 A265110 #12 Apr 29 2017 04:30:57
%S A265110 1,2,3,2,4,5,2,6,7,2,4,8,3,9,2,10,11,2,4,12,13,2,14,3,15,2,4,8,16,17,
%T A265110 2,6,18,19,2,4,20,3,21,2,22,23,2,4,8,24,5,25,2,26,3,9,27,2,4,28,29,2,
%U A265110 6,30,31,2,4,8,16,32,3,33,2,34,5,35,2,4,12,36
%N A265110 Partial row products of table A027746, prime factors with repetition.
%C A265110 T(n,1) = A020639(n); T(n,A001222(n)) = n.
%H A265110 Reinhard Zumkeller, <a href="/A265110/b265110.txt">Rows n = 1..1000 of triangle, flattened</a>
%F A265110 T(n,k) = product(A027747(n,k): k = 1 .. A001221(n)).
%e A265110 . n | T(n,*) | A027746(n,*)
%e A265110 . ----+----------------+----------------
%e A265110 . 1 | 1 | 1
%e A265110 . 2 | 2 | 2
%e A265110 . 3 | 3 | 3
%e A265110 . 4 | 2, 4 | 2, 2
%e A265110 . 5 | 5 | 5
%e A265110 . 6 | 2, 6 | 2, 3
%e A265110 . 7 | 7 | 7
%e A265110 . 8 | 2, 4, 8 | 2, 2, 2
%e A265110 . 9 | 3, 9 | 3, 3
%e A265110 . 10 | 2, 10 | 2, 5
%e A265110 . 11 | 11 | 11
%e A265110 . 12 | 2, 4, 12 | 2, 2, 3
%e A265110 . 13 | 13 | 13
%e A265110 . 14 | 2, 14 | 2, 7
%e A265110 . 15 | 3, 15 | 3, 5
%e A265110 . 16 | 2, 4, 8, 16 | 2, 2, 2, 2
%e A265110 . 17 | 17 | 17
%e A265110 . 18 | 2, 6, 18 | 2, 3, 3
%e A265110 . 19 | 19 | 19
%e A265110 . 20 | 2, 4, 20 | 2, 2, 5
%t A265110 Table[FoldList[Times, Flatten[FactorInteger[n] /. {p_, e_} /; e > 0 :> ConstantArray[p, e]]], {n, 37}] // Flatten (* _Michael De Vlieger_, Apr 28 2017 *)
%o A265110 (Haskell)
%o A265110 a265110 n k = a265110_tabf !! (n-1) !! (k-1)
%o A265110 a265110_row n = a265110_tabf !! (n-1)
%o A265110 a265110_tabf = map (scanl1 (*)) a027746_tabf
%Y A265110 Cf. A027746, A175943, A001222 (row lengths), A020639.
%K A265110 nonn,tabf
%O A265110 1,2
%A A265110 _Reinhard Zumkeller_, Dec 01 2015