165177

Appears in sequences

• Main diagonal of Wythoff array: w(n,n)=[ n*tau ]F(n+1)+(n-1)F(n), where tau=(1+sqrt(5))/2, F(n) = Fibonacci numbers.at n=17A020941
• Fibonacci sequence beginning 5, 12.at n=21A022137
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k nonincreasing even cycles (0<=k<=floor(n/4)). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1)<b(2)<b(3)<... . A cycle is said to be even if it has an even number of entries. For example, the permutation (1528)(347)(6) has 1 nonincreasing even cycles.at n=16A186769
• Number of 3Xn 0..1 arrays with every element equal to 0, 1, 3 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=11A302082