
EXAMPLE

The table reads:
n \ k's
0 : 0, 1, ..., 9, 13, 14, 15, 16, 18, 19, 24, 25, 27, (...), 81, 86 (cf. A007377)
1 : 10, 11, 12, 17, 20, 21, 22, 23, 26, 29, 30, 38, 40, 41, 44, (...), 151, 184
2 : 42, 52, 54, 55, 56, 59, 60, 62, 63, 64, 78, 80, 82, 92, 107, (...), 171, 231
3 : 43, 53, 61, 69, 70, 83, 87, 89, 90, 93, 109, 112, 114, 115, (...), 221, 359
4 : 79, 91, 94, 97, 106, 118, 126, 127, 137, 139, 157, 159, 170, (...), 241, 283
5 : 88, 98, 99, 103, 104, 113, 120, 143, 144, 146, 152, 158, 160, (...), 343, 357
...
Column 0 is A031146: least k such that 2^k has n digits '0' in base 10.
Row lengths = number of powers of 2 with exactly n '0's = (36, 41, 31, 34, 25, 32, 37, 23, 43, 47, 33, 35, 29, 27, 27, 39, 34, 34, 28, 29, ...): not in the OEIS.
Largest number in row n = (86, 229, 231, 359, 283, 357, 475, 476, 649, 733, 648, 696, 824, 634, 732, 890, 895, 848, 823, 929, 1092, ...): not in OEIS
Row number of n = Number of '0's in 2^n = A027870: (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, ...)
Inverse permutation (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 36, 37, 38, 10, 11, 12, 13, 39, 14, 15, 40, 41, 42, 43, 16, 17, 44, 18, 19, 45, 46, 20, 21, ...) is not in OEIS.
