84684

Appears in sequences

• a(-1) = 2, a(n) = a(n-1)^2 + n.at n=3A153061
• a(n) = ceiling((n+1/n)^4).at n=16A197903
• Number of nX2 0..1 arrays with no more than floor(nX2/2) elements unequal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..1 order.at n=12A222535
• Number of (n+1)X(3+1) 0..2 arrays with every 2X2 subblock diagonal minimum minus antidiagonal minimum nondecreasing horizontally and diagonal maximum minus antidiagonal maximum nondecreasing vertically.at n=3A253519
• Number of (n+1)X(4+1) 0..2 arrays with every 2X2 subblock diagonal minimum minus antidiagonal minimum nondecreasing horizontally and diagonal maximum minus antidiagonal maximum nondecreasing vertically.at n=2A253520
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock diagonal minimum minus antidiagonal minimum nondecreasing horizontally and diagonal maximum minus antidiagonal maximum nondecreasing vertically.at n=17A253524
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock diagonal minimum minus antidiagonal minimum nondecreasing horizontally and diagonal maximum minus antidiagonal maximum nondecreasing vertically.at n=18A253524
• Number of finite edges in the graph formed when every pair of vertices of a row of n adjacent congruent rectangles are joined by an infinite line.at n=19A347751