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 A235933 #34 Sep 08 2022 08:46:06 %S A235933 1,2,3,4,6,8,9,11,12,13,16,17,18,19,22,23,24,26,27,29,31,32,33,34,36, %T A235933 37,38,39,41,43,44,46,47,48,51,52,53,54,57,58,59,61,62,64,66,67,68,69, %U A235933 71,72,73,74,76,78,79,81,82,83,86,87,88,89,92,93,94,96,97,99 %N A235933 Numbers coprime to 35. %C A235933 The asymptotic density of this sequence is 24/35. - _Amiram Eldar_, Oct 23 2020 %H A235933 Bruno Berselli, <a href="/A235933/b235933.txt">Table of n, a(n) for n = 1..1000</a> %H A235933 <a href="/index/Rec#order_23">Index entries for linear recurrences with constant coefficients</a>, signature (0,1,1,0,-1,-1,0,1,1,0,-1,-1,0,1,1,0,-1,-1,0,1,1,0,-1). %t A235933 Select[Range[100], GCD[#, 35] == 1 &] (* _Bruno Berselli_, Mar 27 2014 *) %o A235933 (Sage) [i for i in range(100) if gcd(i, 35) == 1] # _Bruno Berselli_, Mar 27 2014 %o A235933 (Magma) [n: n in [1..100] | GCD(n,35) eq 1]; // _Bruno Berselli_, Mar 27 2014 %o A235933 (Haskell) %o A235933 a235933 n = a235933_list !! (n-1) %o A235933 a235933_list = filter ((== 1) . gcd 35) [1..] %o A235933 -- _Reinhard Zumkeller_, Mar 27 2014 %Y A235933 Cf. A160547 (numbers coprime to 31), A229968 (numbers coprime to 33), A204458 (numbers coprime to 34), A007310 (numbers coprime to 36). %Y A235933 Cf. A045572 (numbers not divisible by 5 or 2), A229829 (numbers not divisible by 5 or 3), A047201 (numbers not divisible by 5), A236207 (numbers not divisible by 5 or 11). %K A235933 nonn,easy %O A235933 1,2 %A A235933 _Oleg P. Kirillov_, Jan 17 2014 %E A235933 Signature corrected from _Georg Fischer_, Feb 07 2021 %E A235933 Erroneous recurrence removed from _Bruno Berselli_, Feb 08 2021