133012

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 = (Lucas numbers), t = (primes).at n=27A025098
• Number of length n words on alphabet {0,1} such that the length of every maximal block of 0's (runs) is the same.at n=24A243815