121159

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 = A014306.at n=46A024467
• Number of length n arrays of permutations of 0..n-1 with each element moved by -2 to 2 places and equal numbers of elements moved upwards and downwards.at n=15A263738
• Pisot sequence E(8,12), a(n) = floor( a(n-1)^2/a(n-2) + 1/2 ).at n=23A274951