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 A280705 #11 Mar 19 2017 01:08:25
%S A280705 1,2,6,2,30,2,6,30,210,2,6,30,30,210,30,30,2310,2,6,30,30,210,30,30,
%T A280705 210,2310,30,30,210,210,30,210,30030,2,6,30,30,210,30,30,210,2310,30,
%U A280705 30,210,210,30,210,2310,30030,30,30,210,210,30,210,2310,2310,30,210,210,2310,30030,210,510510,2,6,30,30,210,30,30
%N A280705 a(n) = A002110(A280700(n)) = A046523(A283475(n)).
%H A280705 Antti Karttunen, <a href="/A280705/b280705.txt">Table of n, a(n) for n = 0..8191</a>
%F A280705 a(n) = A002110(A280700(n)) = A046523(A283475(n)).
%t A280705 Table[Times @@ Prime@ Range@ DigitCount[2 n - DigitCount[2 n, 2, 1], 2, 1], {n, 0, 71}] (* or *)
%t A280705 Map[Times @@ MapIndexed[Prime[First[#2]]^#1 &, Reverse@ Sort[FactorInteger[#][[All, -1]]]] - Boole[# == 1] &, Map[Times @@ Prime@ Flatten@ Position[#, 1] &@ Reverse@ IntegerDigits[#, 2] &, Table[2 n - DigitCount[2 n, 2, 1], {n, 0, 71}]]] (* _Michael De Vlieger_, Mar 18 2017 *)
%o A280705 (Scheme)
%o A280705 (define (A280705 n) (A002110 (A280700 n)))
%o A280705 (define (A280705 n) (A046523 (A283475 n)))
%Y A280705 Cf. A002110, A005117, A046523, A280700, A283475.
%K A280705 nonn
%O A280705 0,2
%A A280705 _Antti Karttunen_, Mar 16 2017