68166

Appears in sequences

• Number of reduced magic borders of order n (these extend magic squares of order n-2 to order n).at n=8A091990
• Triangle read by rows, T(n, k) = binomial(n, k) * Sum_{j=0..n-k} E(n-k, j)*2^j, where E(n, k) are the Eulerian numbers A173018(n, k), for 0 <= k <= n.at n=49A154921
• Shifts left under XOR-convolution: a(n) = Sum_{k=0..n-1} a(k) XOR a(n-k-1) for n>1 with a(0)=1, a(1)=2.at n=11A192484
• Number of (n+1) X 3 0..1 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) nondecreasing in column and row directions, respectively.at n=39A204645
• Triangle relating to ordered Bell numbers, A000670.at n=41A208744
• Sum of largest parts of all partitions of n plus n. Also, total number of parts in all partitions of n plus n.at n=31A225596
• Triangle read by rows: T(n,k) is the number of labeled loop-threshold graphs on vertex set [n] with k components, for n >= 1 and 1 <= k <= n.at n=40A350531