121626

Appears in sequences

• Number of nX3 0..1 arrays with every element equal to 1, 2, 3 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=7A302467
• a(n) = Fibonacci(n-1) + Fibonacci(floor(n/2)).at n=27A336030
• Triangular array read by rows: T(n, k) = number of occurrences of 2k as a sum |1 - p(1)| + |2 - p(2)| + ... + |n - p(n)|, where (p(1), p(2), ..., p(n)) ranges through the permutations of (1,2,...,n), for n >= 1, 0 <= k <= n-1.at n=64A357329