258592

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (odd natural numbers).at n=34A024463
• Principal diagonal of the convolution array A213768.at n=17A213769
• Numbers n such that 3^9*2^n - 1 is prime.at n=33A231374