112485

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 = (Lucas numbers).at n=19A024459
• s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = (Lucas numbers).at n=18A025079
• Number of perfect matchings in graph P_{2} X P_{3} X P_{n}.at n=6A028447
• Number of perfect matchings in graph P_{2} X P_{6} X P_{n}.at n=3A028450
• T(n,k) = number of n X k matrices containing a permutation of 1..n*k moving each element at most to a neighboring position.at n=30A181206
• T(n,k) = number of n X k matrices containing a permutation of 1..n*k moving each element at most to a neighboring position.at n=33A181206