|
Search: id:A098670
|
|
|
| A098670 |
|
Start with a(1) = 5. Construct slowest growing sequence such that the statement "the a(n)-th digit is a 2" is true for all n. |
|
+0
3
|
|
| 5, 10, 12, 14, 16, 21, 23, 25, 27, 31, 42, 62, 72, 82, 84, 92, 93, 95, 96, 98, 102, 105, 108, 111, 114, 117, 119, 120, 135, 138, 162, 165, 168, 171, 202, 303, 306, 322, 422, 423, 432, 442, 452, 462, 472, 482, 522
(list; graph; listen)
|
|
|
|
|
Search completed in 0.002 seconds
|
