31062

Appears in sequences

• a(n) = ADP(n) is the total number of aperiodic k-double-palindromes of n, where 2 <= k <= n.at n=21A181135
• Number of n X n 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 0,3,2,1,4 for x=0,1,2,3,4.at n=6A196071
• Number of nX7 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 0,3,2,1,4 for x=0,1,2,3,4.at n=6A196077
• T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..1 nXk array.at n=47A218897
• Number of 3Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..1 3Xn array.at n=7A218899
• Number of (n+6)X(n+6) 0..1 matrices with each 7X7 subblock idempotent.at n=4A224580
• Number of (n+6)X11 0..1 matrices with each 7X7 subblock idempotent.at n=4A224585
• Number of partitions of n such that (greatest part) is not = (multiplicity of greatest part).at n=38A240057
• Related to label-increasing forests with branching bounded by 3.at n=8A297197
• Number of nX7 0..1 arrays with every element unequal to 0, 2, 3, 5 or 8 king-move adjacent elements, with upper left element zero.at n=8A305359