42039

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 2.at n=15A049968
• Numerators of convergents to log_2(10).at n=9A073733
• a(n) is the sum of a sequence of multiples of the n-th prime such that it contains each of the digits from 0 to 9 exactly once and with the least sum possible, or 0 if there is no satisfying sequence.at n=39A274328
• Positive numbers k at which min{abs(2^k - 10^y)/10^y: y in Z} reaches a new minimum.at n=10A333332
• Diagonal of the triangle A354700.at n=22A354701