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 A168265 #12 Jul 27 2016 21:22:58
%S A168265 1,1,2,1,2,3,4,1,2,3,4,5,6,1,2,3,4,5,6,7,8,9,10,1,2,3,4,5,6,7,8,9,10,
%T A168265 11,12,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,1,2,3,4,5,6,7,8,9,10,11,
%U A168265 12,13,14,15,16,17,18,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20
%N A168265 a(n) = A003557(A060735(n)).
%C A168265 A060735(n) belongs to A168264 if and only if a(n) belongs to A168267.
%C A168265 Looking at A060735 as an irregular triangle T(n,k) = k*A002110(n) with 1 <= k < prime(n+1), this sequence a(n) = k. - _Michael De Vlieger_, Jul 26 2016
%H A168265 Michael De Vlieger, <a href="/A168265/b168265.txt">Table of n, a(n) for n = 1..10123</a> (first 68 rows)
%F A168265 Integers 1 to A006093(1) inclusive, followed by integers 1 to A006093(2) inclusive, etc.
%F A168265 a(n) = A111701(A060735(n)).
%F A168265 T(n,k)=k for n >= 1 and 1 <= k < prime(n).
%t A168265 Table[Range[Prime[n] - 1], {n, 9}] // Flatten (* or, per title definition: *)
%t A168265 #/Times @@ (FactorInteger[#][[All, 1]]) & /@ Flatten@ Table[Range[Prime[n + 1] - 1] Apply[Times, Prime@ Range@ n], {n, 0, 8}] (* _Michael De Vlieger_, Jul 26 2016 *)
%Y A168265 Cf. A002110, A006093, A060735.
%K A168265 easy,nonn
%O A168265 1,3
%A A168265 _Matthew Vandermast_, Nov 23 2009