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