|
| |
|
|
A109440
|
|
Let n be an even integer greater than or equal than 4. Let "PrimeP" be the set of prime partition points {p,q} corresponding to n such that n = p + q, p and q are prime and p <= q. Let "CompP" be the set of composite partition points {p,q} corresponding to n such that n = p + q, p is prime, q is composite and p <= q. Let "AllP" be the (disjoint) union of the sets PrimeP and CompP. Let "LPrimeP", "LCompP" and "LAllP" denote the lengths of the sets = PrimeP, CompP and AllP, respectively. Sequence gives values of n such that LPrimeP=LCompP.
|
|
0
| |
|
|
2, 6, 8, 14, 16, 18, 20, 26, 30, 42, 108, 132
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
EXAMPLE
| Example: n=30
AllP={{2,28},{3,27},{5,25},{7,23},{11,19},{13,17}}
PrimeP={{7,23},{11,19},{13,17}}
CompP={{2,28},{3,27},{5,25}}
LPrimeP=LCompP=3
|
|
|
CROSSREFS
| Sequence in context: A107505 A074400 A165607 * A063242 A104636 A137831
Adjacent sequences: A109437 A109438 A109439 * A109441 A109442 A109443
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Gilmar Rodriguez Pierluissi (gilmarlily(AT)yahoo.com), Aug 26 2005
|
| |
|
|
