39921

Appears in sequences

• a(n) = Fibonacci(2n+1) + n*2^(n-1).at n=11A081663
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (-1, 1, 0), (1, 0, -1), (1, 0, 0)}.at n=10A148634
• Number of (n+1)Xn arrays containing n copies of 0..n+1-1 with every element equal to or 1 greater than any north, west or southwest neighbors modulo n and the upper left element equal to 0.at n=10A267339