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 A304087 #6 May 12 2018 14:44:54
%S A304087 1,2,6,3,30,15,5,10,210,105,35,7,70,14,42,21,2310,1155,385,77,11,770,
%T A304087 154,22,462,231,33,330,165,55,110,30030,66,6006,3003,1001,143,13,
%U A304087 15015,5005,715,65,10010,2002,286,26,4290,2145,429,39,858,78,2730,1365,455,91,910,182,546,273,510510,1430,130,390,195,255255,85085,17017,2431,221,17,170170
%N A304087 Divisor-or-multiple permutation of squarefree numbers: a(n) = A019565(A304083(n)).
%C A304087 Each a(n+1) is either a divisor or a multiple of a(n).
%H A304087 Antti Karttunen, <a href="/A304087/b304087.txt">Table of n, a(n) for n = 0..8191</a>
%F A304087 a(n) = A019565(A304083(n)).
%o A304087 (PARI)
%o A304087 A019565(n) = {my(j,v); factorback(Mat(vector(if(n, #n=vecextract(binary(n), "-1..1")), j, [prime(j), n[j]])~))}; \\ From A019565
%o A304087 A304087(n) = A019565(A304083(n)); \\ Needs also code from A304083.
%Y A304087 Cf. A019565, A304083, A304085.
%Y A304087 Cf. also A303778.
%K A304087 nonn
%O A304087 0,2
%A A304087 _Antti Karttunen_, May 06 2018