285931

Appears in sequences

• Numerators in a worst case of a Jacobi symbol algorithm.at n=9A005825
• Worst case of a Jacobi symbol algorithm.at n=8A005826
• Number of n-ary words beginning with the first character of the alphabet, that can be built by inserting four doublets into the initially empty word.at n=28A194716
• Number of nX3 0..1 arrays with every element equal to 1, 2, 3, 4, 5 or 8 king-move adjacent elements, with upper left element zero.at n=6A299368
• Number of nX7 0..1 arrays with every element equal to 1, 2, 3, 4, 5 or 8 king-move adjacent elements, with upper left element zero.at n=2A299372
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 4, 5 or 8 king-move adjacent elements, with upper left element zero.at n=38A299373
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 4, 5 or 8 king-move adjacent elements, with upper left element zero.at n=42A299373