|
Search: id:A096063
|
|
|
| A096063 |
|
Beginning with the sequence S(1)={1} form, in succession, the sequence S(n) for n=2,3,4,... by inserting the n smallest multiples of n that have not been used previously, in order of increasing size, n-1 of them between the final n terms of S(n-1) and the final multiple after the last term of S(n-1). {a(n)} is the limit of this process as n -> inf. |
|
+0
2
|
|
| 2, 3, 1, 8, 6, 12, 5, 4, 10, 16, 18, 15, 24, 9, 36, 7, 25, 14, 42, 21, 20, 32, 28, 40, 48, 64, 35, 72, 27, 30, 45, 80, 63, 49, 81, 88, 50, 90, 60, 54, 70, 99, 100, 96, 110, 11, 108, 22, 120, 33, 56, 44, 130, 55, 117, 84, 66, 144, 140, 156, 77, 168, 104, 180, 121, 192, 13
(list; graph; listen)
|
|
|
Search completed in 0.001 seconds
|
