|
Search: id:A008364
|
|
|
| A008364 |
|
Not divisible by 2, 3, 5 or 7. |
|
+0
25
|
|
| 1, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 121, 127, 131, 137, 139, 143, 149, 151, 157, 163, 167, 169, 173, 179, 181, 187, 191, 193, 197, 199, 209, 211, 221, 223, 227, 229, 233, 239, 241, 247
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
First 48 terms give reduced residue system for 4th primorial number 210=A005867(4).
The sequence is multiplicative in the (nonstandard) sense that any product of terms is also a term. - Labos E. (labos(AT)ana.sote.hu), Feb 26 2003
Also the 11-rough numbers: positive integers that have no prime factors less than 11 [From Michael Porter (michael_b_porter(AT)yahoo.com), Oct 10 2009]
|
|
REFERENCES
|
Diatomic sequence of 4th prime: A. de Polignac (1849), J. Dechamps J. (1907).
Dickson L. E., History of the Theory of Numbers, Vol. 1, p. 439, Chelsea, 1952.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Rough Number From MathWorld--A Wolfram Web Resource. [From Michael Porter (michael_b_porter(AT)yahoo.com), Oct 10 2009]
Index entries for sequences related to smooth numbers [From Michael Porter (michael_b_porter(AT)yahoo.com), Oct 10 2009]
|
|
MAPLE
|
for i from 1 to 500 do if gcd(i, 210) = 1 then print(i); fi; od;
t1:=[]; for i from 1 to 1000 do if gcd(i, 210) = 1 then t1:=[op(t1), i]; fi; od: t1;
|
|
MATHEMATICA
|
Select[ Range[ 300 ], GCD[ #1, 210 ]==1& ]
|
|
PROGRAM
|
(PARI) isA008364(n) = gcd(n, 210)==1 [From Michael Porter (michael_b_porter(AT)yahoo.com), Oct 10 2009]
|
|
CROSSREFS
|
First differences give A049296. Cf. A008364, A002110, A048597, A005867.
For k-rough numbers with other values of k, see A000027 A005408 A007310 A007775 A008364 A008365 A008366 A166061 A166063 [From Michael Porter (michael_b_porter(AT)yahoo.com), Oct 10 2009]
Sequence in context: A063193 A056758 A096489 this_sequence A140461 A120533 A095862
Adjacent sequences: A008361 A008362 A008363 this_sequence A008365 A008366 A008367
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.003 seconds
|
