353302

Appears in sequences

• Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two, three, four, six, seven or eight distinct values for every i,j,k<=n.at n=9A211597
• Difference between sum of largest parts and sum of smallest parts of all partitions of n into an even number of parts.at n=43A211881