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 A236206 #24 Oct 23 2020 03:27:56
%S A236206 1,2,4,8,11,13,16,17,19,22,23,26,29,31,32,34,37,38,41,43,44,46,47,52,
%T A236206 53,58,59,61,62,64,67,68,71,73,74,76,79,82,83,86,88,89,92,94,97,101,
%U A236206 103,104,106,107,109,113,116,118,121,122,124,127,128,131,134,136
%N A236206 Numbers not divisible by 3, 5 or 7.
%C A236206 Numbers whose odd part is 11-rough: products of terms of A008364 and powers of 2 (terms of A000079). - _Peter Munn_, Aug 03 2020
%C A236206 Numbers coprime to 105. The asymptotic density of this sequence is 16/35. - _Amiram Eldar_, Oct 23 2020
%H A236206 Vincenzo Librandi, <a href="/A236206/b236206.txt">Table of n, a(n) for n = 1..1000</a>
%H A236206 <a href="/index/Rec#order_49">Index entries for linear recurrences with constant coefficients</a>, signature (1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1).
%F A236206 a(n) = a(n-1) + a(n-48) - a(n-49). - _Amiram Eldar_, Oct 23 2020
%t A236206 Select[Range[300], Mod[#, 3] > 0 && Mod[#, 5] > 0 && Mod[#, 7] > 0 &] (* _T. D. Noe_, Feb 05 2014 *)
%t A236206 Select[Range[300],Or@@Divisible[#,{3,5,7}]==False&] (* _Harvey P. Dale_, Mar 13 2014 *)
%t A236206 Select[Range[150], CoprimeQ[105, #] &] (* _Amiram Eldar_, Oct 23 2020 *)
%Y A236206 Subsequences: A000079, A008364.
%Y A236206 Intersection of any 2 of A160545, A229829, A235933.
%Y A236206 Other sequences with similar definitions: A007775, A236217.
%K A236206 nonn,easy
%O A236206 1,2
%A A236206 _Oleg P. Kirillov_, Jan 20 2014