|
Search: id:A122936
|
|
|
| A122936 |
|
2-Round numbers: numbers n such that every number less than n and relatively prime to n has at most two prime factors (counting multiplicities). |
|
+0
3
|
|
| 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 30, 36, 42, 48, 54, 60, 66, 72, 78, 84, 90, 96, 102, 108, 114, 120, 150, 180, 210, 240, 270, 300, 330, 420, 630, 840, 1050, 1260
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
This sequence, for r=2 prime factors, is finite. Maillet proved that such sequences are finite for any fixed r. The case r=1 is A048597; case r=3 is A122937.
|
|
REFERENCES
|
Dickson, History of the Theory of Numbers, Vol. I, Chelsea, New York, 1952, p. 134.
|
|
MATHEMATICA
|
Omega[n_] := If[n==1, 0, Plus@@(Transpose[FactorInteger[n]][[2]])]; nn=1260; r=2; moreThanR=Select[Range[nn], Omega[ # ]>r&]; lst={1}; Do[s=Select[Range[n], GCD[n, # ]==1&]; If[Intersection[s, moreThanR]=={}, AppendTo[lst, n]], {n, 2, nn}]; lst
|
|
CROSSREFS
|
Cf. A048597 (very round numbers), A051250, A089016 (largest n-round number).
Sequence in context: A032958 A080750 A113768 this_sequence A118729 A008726 A022788
Adjacent sequences: A122933 A122934 A122935 this_sequence A122937 A122938 A122939
|
|
KEYWORD
|
fini,full,nonn
|
|
AUTHOR
|
T. D. Noe (noe(AT)sspectra.com), Sep 21 2006
|
|
|
Search completed in 0.003 seconds
|
