98330

Appears in sequences

• Number of nX3 0..5 arrays with values 0..5 introduced in row major order and each element equal to at least one horizontal or vertical neighbor.at n=4A198622
• Number of nX5 0..5 arrays with values 0..5 introduced in row major order and each element equal to at least one horizontal or vertical neighbor.at n=2A198624
• T(n,k)=Number of nXk 0..5 arrays with values 0..5 introduced in row major order and each element equal to at least one horizontal or vertical neighbor.at n=23A198627
• T(n,k)=Number of nXk 0..5 arrays with values 0..5 introduced in row major order and each element equal to at least one horizontal or vertical neighbor.at n=25A198627
• Column 32769 of array A269158: a(n) = F(n,65537), function F as defined in A269158.at n=45A268819
• Number of n X 2 0..1 arrays with every element unequal to 0, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=16A304004
• a(n) = 48*2^n + 26 (n>=1).at n=10A304605
• Shortest distance from curve start to end along the segments of dragon curve expansion level n, and which is the diameter of the curve as a graph.at n=30A343949
• Number of permutations of [n] such that precisely one rising or falling succession occurs, but without either n(n-1) or (n-1)n.at n=8A383857