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 A230193 #28 Mar 25 2021 04:56:17 %S A230193 3,6,9,11,12,15,18,21,22,24,27,30,33,36,39,42,44,45,48,51,54,55,57,60, %T A230193 63,66,69,72,75,77,78,81,84,87,88,90,93,96,99,102,105,108,110,111,114, %U A230193 117,120,121,123,126,129,132,135,138,141,143,144,147,150,153 %N A230193 Numbers divisible by 3 or 11. %C A230193 In general, sequences of numbers divisible by primes p and q have the form a(n+p+q-1) = a(n) + p*q. %C A230193 Union of A008585 and A008593 (0 excluded). - _Michel Marcus_, Oct 16 2013 %C A230193 The asymptotic density of this sequence is 13/33. - _Amiram Eldar_, Mar 25 2021 %H A230193 Amiram Eldar, <a href="/A230193/b230193.txt">Table of n, a(n) for n = 1..10000</a> %F A230193 a(n+13) = a(n) + 33. %p A230193 for n from 1 to 53 do if n mod 3 = 0 and n mod 11 = 0 then print(n) fi od %t A230193 Select[Range[200], GCD[#, 33] > 1 &] (* _T. D. Noe_, Oct 15 2013 *) %Y A230193 Complement of A229968. %Y A230193 Cf. A008585, A008593. %K A230193 nonn %O A230193 1,1 %A A230193 _Gary Detlefs_, Oct 11 2013