%I #28 Aug 19 2013 17:58:03
%S 1,13,29,43,53,59,71,73,79,83,89,97,101,103,149,163,169,173,179,191,
%T 193,199,211,221,223,239,263,269,281,283,289,293,299,307,311,313,331,
%U 359,373,379,383,389,401,403,409,419,421,431,433,449,479,491,493,499,503
%N Signed pseudo characteristic function of primes by annihilation of composites up to p-1, here p=13 and sign (+).
%C a(n) is defined by the sign of the product sin(n*Pi/2) * sin(n*Pi/3) * sin(n*Pi/5) * sin(n*Pi/7) * sin(n*Pi/11), where Pi is A000796.
%C This construction assigns values a(p)=0 to the primes up to p-1 (here p=13), values a(p)=+1 to the primes from p to p^2-1, and zeros to all composites up to p^2-1.
%C The offset has been set to p to eliminate the leading zeros.
%C The "pseudo" in the name indicates that this kind of Fourier synthesis (or sieve) starts to fail at n=169=p^2: a(169)=1 although 169 is a composite number.
%C The extrema of the sine function are prime numbers, while the zeros are the composite numbers annihilated in the interval [p,p^2[.
%C A generalization is to use the sign of sin(n*Pi/2) *sin(n*Pi/3)*... *sin(n*Pi/p) for an even higher number of sine factors, which works to indicate correctly primes and composites in the interval n=p to p^2-1.
%H Freimut Marschner and T. D. Noe, <a href="/A228069/b228069.txt">Table of n, a(n) for n = 1..1000</a> (249 terms from Freimut Marschner)
%F Numbers n such that sign(sin(n*Pi/2) * sin(n*Pi/3) * sin(n*Pi/5) * sin(n*Pi/7) * sin(n*Pi/11)) = 1.
%t Select[Range[1000], Sign[Sin[#*Pi/2] * Sin[#*Pi/3] * Sin[#*Pi/5] * Sin[#*Pi/7] * Sin[#*Pi/11]] == 1 &] (* _T. D. Noe_, Aug 16 2013 *)
%Y Cf. A228070.
%K nonn
%O 1,2
%A _Freimut Marschner_, Aug 08 2013
|