39664

Appears in sequences

• s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A001950 (upper Wythoff sequence).at n=25A024594
• s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = A001950 (upper Wythoff sequence).at n=24A025108
• Expansion of (theta_3(z)*theta_3(11z) + theta_2(z)*theta_2(11z))^4.at n=27A028612
• a(n) is the smallest number which when written in binary contains as substrings the binary expansions of 1..n.at n=15A056744
• Smallest number containing in its binary representation substrings forming an arithmetic progression exactly of size n.at n=16A091461
• Indices of prime generalized tetranacci numbers, A073817.at n=29A104577
• a(n) = smallest positive multiple of n that, when represented in binary, contains the binary representations of all positive integers <= n at least once each.at n=15A144144
• Where records occur in A261461.at n=13A261467
• a(0) = 1; a(n) = Sum_{k=0..floor((n-1)/2)} (-3)^k * a(k) * a(n-2*k-1).at n=14A352010