20103

Appears in sequences

• a(n) = A027082(n, 2n-6).at n=9A027093
• A vector recursion designed around a factorial row sum : v(n)=if[odd,{1.n,n^2,...,(n+1)!/2-Sum[2^m,{m,0,n/2-1}],(n+1)!/2-Sum2^m,{m,0,n/2-1}],...n^2.n,1}],if[ even{1.n,n^2,...,(n+1)!-2Sum[2^m,{m,0,n/2-1}],...n^2.n,1}].at n=31A152938
• A vector recursion designed around a factorial row sum : v(n)=if[odd,{1.n,n^2,...,(n+1)!/2-Sum[2^m,{m,0,n/2-1}],(n+1)!/2-Sum2^m,{m,0,n/2-1}],...n^2.n,1}],if[ even{1.n,n^2,...,(n+1)!-2Sum[2^m,{m,0,n/2-1}],...n^2.n,1}].at n=32A152938
• a(n) = 38*n^2 + 1.at n=23A158593
• Number of nonincreasing even cycles in all permutations of {1,2,...,n}. 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.at n=8A184958
• Coefficient of x in the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.at n=18A192968
• Wiener index of a benzenoid consisting of a zig-zag chain of n hexagons (s=13; see the Gutman et al. reference).at n=14A193393
• Base 2i representation of nonnegative integers.at n=31A212494