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 A283475 #22 Apr 18 2017 15:39:31
%S A283475 1,2,6,5,30,7,21,42,210,11,33,66,165,330,154,231,2310,13,39,78,195,
%T A283475 390,182,273,1365,2730,286,429,1430,2145,1001,2002,30030,17,51,102,
%U A283475 255,510,238,357,1785,3570,374,561,1870,2805,1309,2618,19635,39270,442,663,2210,3315,1547,3094,15470,23205,2431,4862,12155
%N A283475 a(n) = A019565(A005187(n)).
%H A283475 Antti Karttunen, <a href="/A283475/b283475.txt">Table of n, a(n) for n = 0..8191</a>
%F A283475 a(n) = A019565(A005187(n)).
%F A283475 a(n) = A097248(A283477(n)) = A097248(A108951(A019565(n))) = A283478(A019565(n)).
%F A283475 Other identities:
%F A283475 If A004198(x,y) = 0, then a(x+y) = A097248(a(x)*a(y)).
%F A283475 For all n >= 1, a(A000051(n)) = A000040(n+2).
%F A283475 For all n >= 0, A001221(a(n)) = A001222(a(n)) = A280700(n).
%F A283475 For all n >= 0, A046523(a(n)) = A280705(n).
%t A283475 Map[Times @@ Prime@ Flatten@ Position[#, 1] &@ Reverse@ IntegerDigits[#, 2] &, Table[2 n - DigitCount[2 n, 2, 1], {n, 0, 60}]] (* _Michael De Vlieger_, Mar 16 2017 *)
%o A283475 (Scheme) (define (A283475 n) (A019565 (A005187 n)))
%Y A283475 Cf. A000040, A000051, A001221, A001222, A004198, A005117, A005187, A019565, A046523, A097248, A108951, A280700, A280705, A283477, A283478.
%Y A283475 Cf. A283476 (same sequence sorted into ascending order).
%K A283475 nonn,look
%O A283475 0,2
%A A283475 _Antti Karttunen_, Mar 15 2017