59522

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = (primes).at n=27A025088
• Base 4 expansion of 1/n has equal percentage of each digit 0,1,2,3 (primitive values of n only).at n=31A074900
• G.f. satisfies: A(x) = 1 + x*A(x)^4*A(x*A(x)^4).at n=6A215506
• a(n) is the greatest integer such that binomial(a(n),n)*2^(1 - binomial(n,2)) < 1.at n=25A279032