130090

Appears in sequences

• a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 3), t = A023531.at n=20A024313
• Smallest integer k such that 2^n is the largest power of two that is contained in 2^k as a proper substring.at n=28A046300
• Triangle read by rows: T(n,k) is the number of weighted lattice paths B(n) having k uudd strings.at n=41A247297
• a(n) is the exponent of the least power of 2 such that the concatenated digits of the decimal expansion of 2^n are a proper substring of the concatenated digits of the decimal expansion of 2^a(n).at n=28A342575