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 A038179 #85 Nov 24 2024 10:09:30 %S A038179 2,3,5,7,11,13,17,19,23,25,29,31,35,37,41,43,47,49,53,55,59,61,65,67, %T A038179 71,73,77,79,83,85,89,91,95,97,101,103,107,109,113,115,119,121,125, %U A038179 127,131,133,137,139,143,145,149,151 %N A038179 Result of second stage of sieve of Eratosthenes (after eliminating multiples of 2 and 3). %C A038179 2, 3 and numbers of the form 6m +- 1. %C A038179 Apart from first two terms, same as A007310. %C A038179 Terms of this sequence (starting from the third term) are equal to the result of the expression sqrt(4!*(k+1) + 1) - but only when this expression yields integral values (that is when the parameter k takes values, which are terms of A144065). - _Alexander R. Povolotsky_, Sep 09 2008 %C A038179 For every integer n>2, n is in this sequence iff Product_{k=2..oo} 1/(1 - 1/k^n) = Product_{k=1..n} Gamma( 2 - (-1)^(k*(1 + 1/n)) ). - _Federico Provvedi_, Nov 07 2024 %D A038179 Fred S. Roberts, Applied Combinatorics, Prentice-Hall, 1984, p. 256. %H A038179 G. C. Greubel, <a href="/A038179/b038179.txt">Table of n, a(n) for n = 1..2500</a> %H A038179 Ahmed Hamdy A. Diab, <a href="https://arxiv.org/abs/2012.03052">Sequence eliminating law (SEL) and the interval formulas of prime numbers</a>, arXiv:2012.03052 [math.NT], 2020. %H A038179 H. B. Meyer, <a href="http://www.hbmeyer.de/eratosiv.htm">Eratosthenes' sieve</a>. %H A038179 <a href="/index/Si#sieve">Index entries for sequences generated by sieves</a>. %F A038179 O.g.f.: x*(2 + x + x^3 + 2x^4)/((1+x)*(1-x)^2). - _R. J. Mathar_, May 23 2008 %F A038179 a(n) = (1/9)*(4*n^3 + 3*n^2 + 1 - Kronecker(-3,n+1)). - _Ralf Stephan_, Jun 01 2014 %F A038179 From _Mikk Heidemaa_, Oct 28 2017: (Start) %F A038179 a(n) = floor((41/21 - (3 mod n))^(-3*n+5)) + 3*n - 4 (n > 0). %F A038179 a(n+1) = 3*n - ((n mod 2)+1) mod n (n > 0). (End) %F A038179 a(n+2) = 2*floor((3*n+1)/2) + 1 for n>=1; see (17) in Diab link. - _Michel Marcus_, Dec 14 2020 %F A038179 Sum_{n>=1} (-1)^(n+1)/a(n) = (7-sqrt(3)*Pi)/6. - _Amiram Eldar_, Sep 22 2022 %t A038179 max = 200; Complement[Range[2, max], 2Range[2, Ceiling[max/2]], 6Range[2, Ceiling[max/6]] + 3] (* _Alonso del Arte_, May 16 2014 *) %t A038179 Prepend[Table[3*n - Mod[ Mod[n, 2] + 1, n], {n, 1, 999}], 2] (* _Mikk Heidemaa_, Nov 02 2017 *) %Y A038179 Cf. A004280, A007310, A144065. %K A038179 nonn,easy %O A038179 1,1 %A A038179 _N. J. A. Sloane_, Dec 11 1999 %E A038179 Name edited by _Michel Marcus_, Dec 14 2020