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 A162699 #18 Oct 18 2020 03:10:49
%S A162699 1,3,5,9,11,13,15,17,19,23,25,27,29,31,33,37,39,41,43,45,47,51,53,55,
%T A162699 57,59,61,65,67,69,71,73,75,79,81,83,85,87,89,93,95,97,99,101,103,107,
%U A162699 109,111,113,115,117,121,123,125,127,129,131,135,137,139,141,143,145,149
%N A162699 Odd numbers not divisible by 7.
%C A162699 Numbers coprime to 14. The asymptotic density of this sequence is 3/7. - _Amiram Eldar_, Oct 18 2020
%H A162699 Amiram Eldar, <a href="/A162699/b162699.txt">Table of n, a(n) for n = 1..10000</a>
%H A162699 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,1,-1).
%F A162699 a(n) = 2*n + 1 + 2*floor( (2*n-7)/12 ).
%F A162699 a(n) = a(n-1)+a(n-6)-a(n-7). G.f.: x*(x^2+1)*(x^4+2*x^3+x^2+2*x+1)/ ((1+x)*(1+x+x^2)*(x^2-x+1)*(x-1)^2). - _R. J. Mathar_, Jul 31 2009
%t A162699 s={}; Do[If[Mod[n, 7] > 0, AppendTo[s, n]], {n, 1, 60, 2}]; s
%t A162699 Table[2 n + 1 + 2*Floor[(2 n - 7)/12], {n, 1, 99}]
%t A162699 DeleteCases[Range[1,151,2],_?(Divisible[#,7]&)] (* _Harvey P. Dale_, Jul 04 2015 *)
%o A162699 (PARI) a(n)=(14*n-7)\12*2+1 \\ _Charles R Greathouse IV_, Jun 11 2015
%Y A162699 Cf. A045572 (odd numbers not divisible by 5).
%K A162699 nonn,easy
%O A162699 1,2
%A A162699 _Zak Seidov_, Jul 11 2009