119835

Appears in sequences

• Number of inequivalent ways to cut an n X n square into squares with integer sides, such that the dissection has a reflective symmetry in one diagonal, but no other symmetries.at n=8A240123
• Number of 3 X n 0..1 arrays with no element equal to fewer vertical neighbors than horizontal neighbors, with new values 0..1 introduced in row major order.at n=13A240784
• Number of length 2+2 0..n arrays with the sum of the maximum minus the median of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=25A251936
• Number of nX6 0..1 arrays with every element unequal to 1, 2, 4, 5 or 7 king-move adjacent elements, with upper left element zero.at n=6A305013
• Number of nX7 0..1 arrays with every element unequal to 1, 2, 4, 5 or 7 king-move adjacent elements, with upper left element zero.at n=5A305014
• a(n) = Sum_{k=1..n} k^2*phi(k), where phi is the Euler totient function A000010.at n=28A319087