360642

Appears in sequences

• a(n) = 2*a(n-1) - a(n-3) + a(floor(n/2)), where a(0) = 1, a(1) = 1, a(2) = 1.at n=25A298402
• Triangle read by rows: T(n,k) is the number of permutations of k elements from [1..n] without consecutive adjacent values.at n=63A338526