
EXAMPLE

The table reads:
n \ k's
0 : 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 19, 23, 24, 26, 27, 28, 31, 34, 68 (cf. A030700)
1 : 10, 15, 16, 17, 18, 20, 25, 29, 43, 47, 50, 52, 63, 72, 73
2 : 22, 30, 32, 33, 36, 38, 39, 40, 41, 42, 44, 45, 46, 48, 51, 53, 56, 58, 60, 61, 62, 64, 69, 71, 83, 93, 96, 108, 111, 123, 136
3 : 21, 37, 49, 67, 75, 81, 82, 87, 90, 105, 112, 121, 129
4 : 35, 59, 65, 66, 70, 74, 77, 79, 88, 98, 106, 116, 117, 128, 130, 131, 197, 205
5 : 57, 76, 78, 80, 86, 89, 91, 92, 101, 102, 104, 109, 115, 118, 122, 127, 134, 135, 164, 166, 203, 212, 237
...
The first column is A063555: least k such that 3^k has n digits '0' in base 10.
Row lengths are 23, 15, 31, 13, 18, 23, 23, 25, 16, 17, 28, ... (not in OEIS).
Last term of the rows (i.e., largest k such that 3^k has exactly n digits 0) are (68, 73, 136, 129, 205, 237, 317, 268, 251, 276, 343, ...), not in OEIS.
Inverse permutation is (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 23, 10, 11, 12, 13, 24, 25, 26, 27, 14, 28, 69, 38, 15, 16, 29, 17, 18, 19, 30, 39, 20, ...), not in OEIS.
