249999domain: NAppears in sequencesa(n) = smallest k such that 2k has digit sum = n.at n=47A077491Triangle read by rows: T(n, k) = 10^(n-1) - 1 + k*floor(9*10^(n-1)/n), for 1 <= k <= n.at n=15A093846First column of triangle A093846.at n=5A093847a(n) = 2401*n^2 - 3822*n + 1520.at n=10A157370