|
Search: id:A138768
|
|
|
| A138768 |
|
For a positive integer n, write the integers 1,2,...,n in the following order: first write 1 (round 0), then all primes less or equal to n in increasing order (round 1), then 2p for all primes p with 2p<=n, also in increasing order (round 2), then 3p, then 4p and so on. Each number is written down only the first time it is encountered. Let a(n) denote the last number written down. |
|
+0
1
|
|
| 1, 2, 3, 4, 4, 6, 6, 8, 8, 8, 8, 12, 12, 12, 12, 16, 16, 16, 16, 16, 16, 16, 16, 24, 24, 24, 27, 27, 27, 27, 27, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 48, 48, 48, 48, 48, 48, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64
(list; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
