|
Search: id:A056955
|
|
|
| A056955 |
|
Euclid set of class 2 and modulus 3. |
|
+0
1
|
|
| 5, 8, 11, 17, 23, 29, 41, 47, 53, 59, 71, 83, 89, 101, 107, 113, 131, 137, 149, 167, 173, 179, 191, 197, 227, 233, 239, 251, 257, 263, 269, 281, 293, 311, 317, 347, 353, 359, 383, 389, 401, 419, 431, 443, 449, 461, 467, 479, 491, 503, 509, 521, 557, 563, 569
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Euclid(c,m,t) results from the action of the extended Eratosthenes Sieve (XES) on the base sequence c+m*k, from c+m up to t with GCD(c,m)=1, and 0<c<m. XES selects integers in a positive sequence from left to right, according to mutual primality. XES(Naturals)=Primes and Euclid(1,2)=XES(OddNaturals)=OddPrimes
|
|
LINKS
|
Andrea Ercolino, XGC - An extension of the Goldbach Conjecture
|
|
EXAMPLE
|
Using Euclid(2,3,600) as the base set for XGC: ..., 171=5+17+149, 174=8+17+149, 177=5+5+167, ... i.e. multiples of 3 are expressible as sums of 3 numbers of the set Euclid(2,3) just like using OddPrimes as the base set for GC: ..., 172=5+167, 174=7+167, 176=3+173, ... i.e. EvenNaturals (multiples of 2) are expressible as sums of 2 OddPrimes (numbers of the set Euclid(1,2))
|
|
CROSSREFS
|
Sequence in context: A118520 A001954 A006620 this_sequence A023381 A133522 A133269
Adjacent sequences: A056952 A056953 A056954 this_sequence A056956 A056957 A056958
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Andrea Ercolino (aercolino(AT)yahoo.com)
|
|
|
Search completed in 0.002 seconds
|
