112828

Appears in sequences

• a(n) = number of (s(0), s(1), ..., s(n)) such that s(i) is an integer, s(0) = 0, |s(1)| = 1, |s(i) - s(i-1)| <= 1 for i >= 2, s(n) = 2. Also a(n) = T(n,n-2), where T is the array defined in A025177.at n=11A025180
• a(n) = (2*n - 1)*(3*n^2 - 3*n + 2)/2.at n=33A063491
• The number of matchings in the n-flower graph.at n=4A236549
• a(n) = 2*a(n-1) - a(n-2) + a(n-3) - a(n-4), where a(0) = 2, a(1) = 4, a(2) = 5, a(3) = 6.at n=29A288429