Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A109611
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A109611 Chen primes: primes p such that p + 2 is either a prime or a semiprime. +0
45
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 47, 53, 59, 67, 71, 83, 89, 101, 107, 109, 113, 127, 131, 137, 139, 149, 157, 167, 179, 181, 191, 197, 199, 211, 227, 233, 239, 251, 257, 263, 269, 281, 293, 307, 311, 317, 337, 347, 353, 359, 379, 389, 401, 409 (list; graph; listen)
OFFSET

1,1

COMMENT

43 is the first prime which is not a member (see A102540).

Contains A001359 = lesser of twin primes.

REFERENCES

B. Green and T. Tao, Restriction theory of the Selberg sieve, with applications, 2005, pp. 5, 14, 18 - 19, 21

LINKS

R. J. Mathar, Table of n, a(n) for n = 1..34076

B. Green and T. Tao, Restriction theory of the Selberg sieve, with applications

Eric Weisstein's World of Mathematics, Chen's Theorem

Eric Weisstein's World of Mathematics, Chen Prime

Wikipedia, Chen prime

EXAMPLE

a(4) = 7 because 7 + 2 = 9 and 9 is a semiprime.

a(5) = 11 because 11 + 2 = 13, a prime.

MAPLE

with(numtheory): ts_chen:= proc(n) local i, p, ans; ans:=[ ]; for i from 1 to n do if ( isprime(i) = true) then if ( isprime(i+2) = true or bigomega(i+2) = 2 ) then ans:=[ op(ans), i ] fi: fi: od: RETURN(ans); end: ts_chen(5000); - Jani Melik (jani_melik(AT)hotmail.com), May 04 2006

ts_chen:= proc(n) local i, ans; ans:=[ ]: for i from 1 to n do if ( isprime(i) = 'true') then if ( isprime(i+2) = 'true' or numtheory[bigomega](i+2) = 2) then ans:=[ op(ans), i ] fi fi od: return ans end: ts_chen(1000); - Jani Melik (jani_melik(AT)hotmail.com), May 05 2006

MATHEMATICA

semiPrimeQ[x_] := TrueQ[Plus @@ Last /@ FactorInteger[ x ] == 2]; Select[Prime[Range[100]], PrimeQ[ # + 2] || semiPrimeQ[ # + 2] &] (Delarte)

PROGRAM

(PARI) isA001358(n)={ if( bigomega(n)==2, return(1), return(0) ); } isA109611(n)={ if( ! isprime(n), return(0), if( isprime(n+2), return(1), return( isA001358(n+2)) ); ); } { n=1; for(i=1, 90000, p=prime(i); if( isA109611(p), print(n, " ", p); n++; ); ); } - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 20 2006

CROSSREFS

Cf. A001358.

Adjacent sequences: A109608 A109609 A109610 this_sequence A109612 A109613 A109614

Sequence in context: A049555 A052042 A086472 this_sequence A078133 A089189 A038612

KEYWORD

nonn

AUTHOR

Paul Muljadi (paulmuljadi(AT)yahoo.com), Jul 31 2005

EXTENSIONS

Corrected by Alonso Delarte (alonso.delarte(AT)gmail.com), Aug 08 2005

page 1

Search completed in 0.003 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research