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 A182940 #7 Jun 28 2017 20:29:11 %S A182940 1,2,4,3,6,12,8,24,9,18,36,16,48,5,10,15,20,30,60,72,40,120,45,90,180, %T A182940 80,240,360,7,14,21,28,35,42,70,84,105,140,210,420,144,720,56,168,280, %U A182940 840 %N A182940 List of divisors of the sequence A094348 in their order of occurrence. %C A182940 Read A094348 term-by-term, compute the divisors of each term, write down any divisors not seen before. %e A182940 1 [1] %e A182940 2 [2] %e A182940 4 [4] %e A182940 6 [3, 6] %e A182940 12 [12] %e A182940 24 [8, 24] %e A182940 36 [9, 18, 36] %e A182940 48 [16, 48] %e A182940 60 [5, 10, 15, 20, 30, 60] %e A182940 72 [72] %e A182940 120 [40, 120] %e A182940 180 [45, 90, 180] %e A182940 240 [80, 240] %e A182940 360 [360] %e A182940 420 [7, 14, 21, 28, 35, 42, 70, 84, 105, 140, 210, 420] %e A182940 720 [144, 720] %e A182940 840 [56, 168, 280, 840] %e A182940 1260 [63, 126, 252, 315, 630, 1260] %e A182940 1680 [112, 336, 560, 1680] %e A182940 2520 [504, 2520] %e A182940 5040 [1008, 5040] %p A182940 concat := (a,h)->[op(a),op(sort(convert(h,list)))]; %p A182940 DivisorsInOrder := proc(S) local A, H, T, s; %p A182940 T := {}; A := []; %p A182940 for s in S do %p A182940 H := numtheory[divisors](s) minus T: %p A182940 if H <> {} then %p A182940 A := concat(A, H); %p A182940 T := T union H %p A182940 fi %p A182940 od; %p A182940 A end: %p A182940 A182940 := DivisorsInOrder(A094348); %Y A182940 Cf. A094348, A096179. %K A182940 nonn %O A182940 1,2 %A A182940 Peter Luschny, Jan 04 2011