|
%I #47 Nov 26 2018 03:54:03
%S 5,9,13,17,21,29,33,37,41,49,53,57,61,69,73,77,89,93,97,101,109,113,
%T 121,129,133,137,141,149,157,161,173,177,181,193,197,201,209,213,217,
%U 229,233,237,241,249,253,257,269,277,281,293,301,309,313,317,321,329
%N S-primes: let S = {1,5,9, ... 4i+1, ...}; then an S-prime is in S but is not divisible by any members of S except itself and 1.
%C Factorization in S is not unique. See related sequences.
%C a(n) ~ C n log n / log log n, where C > 2. - _Thomas Ordowski_, Sep 09 2012
%C Kostrikin calls these numbers quasi-primes. - _Arkadiusz Wesolowski_, Aug 19 2017
%C Union of A002144 and A107978. - _Charlie Neder_, Nov 03 2018
%C a(n) is a prime of the form 4*n + 1 or a product of 2 primes of the form 4*n + 3. - _David A. Corneth_, Nov 10 2018
%D T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, page 101, problem 1.
%D A. I. Kostrikin, Introduction to Algebra, universitext, Springer, 1982.
%H Robert Israel, <a href="/A057948/b057948.txt">Table of n, a(n) for n = 1..10000</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/HilbertNumber.html">Hilbert Number</a> [From _Eric W. Weisstein_, Sep 15 2008]
%e 21 is of the form 4i+1, but it is not divisible by any smaller S-primes, so 21 is in the sequence.
%p N:= 1000: # to get all terms <= N
%p S:= {seq(4*i+1,i=1..floor((N-1)/4))}:
%p for n from 1 while n <= nops(S) do
%p r:= S[n];
%p S:= S minus {seq(i*r,i=2..floor(N/r))};
%p od:
%p S; # _Robert Israel_, Dec 14 2014
%t nn = 100; Complement[Table[4 k + 1, {k, 1, nn}], Union[Flatten[ Table[Table[(4 k + 1) (4 j + 1), {k, 1, j}], {j, 1, nn}]]]] (* _Geoffrey Critzer_, Dec 14 2014 *)
%o (PARI) is(n) = if(n % 2 == 0, return(0)); if(n%4 == 1 && isprime(n), return(1)); f = factor(n); if(vecsum(f[, 2]) != 2, return(0)); for(i = 1, #f[, 1], if(f[i, 1] % 4 == 1, return(0))); n>1 \\ _David A. Corneth_, Nov 10 2018
%Y Cf. A054520, A057949, A057950.
%K nonn
%O 1,1
%A _Jud McCranie_, Oct 14 2000
%E Offset corrected by _Charlie Neder_, Nov 03 2018
|
