66625

Appears in sequences

• Numbers that are the sum of 2 nonzero squares in exactly 8 ways.at n=10A025291
• Numbers that are the sum of 2 nonzero squares in 7 or more ways.at n=10A025298
• Numbers that are the sum of 2 nonzero squares in 8 or more ways.at n=10A025299
• Numbers that are the sum of 2 distinct nonzero squares in exactly 8 ways.at n=10A025309
• Numbers that are the sum of 2 distinct nonzero squares in 7 or more ways.at n=10A025317
• Numbers that are the sum of 2 distinct nonzero squares in 8 or more ways.at n=10A025318
• Number of nonempty subsets of {1,2,...,n} in which exactly 1/5 of the elements are <= (n-2)/2.at n=22A047187
• Numbers n that are the hypotenuse of exactly 31 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 31 ways.at n=5A097244
• Numbers that can be written as the sum of two squares in three ways, using three consecutive squares.at n=5A123204
• Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 00100-11111-00100 pattern in any orientation.at n=13A147010
• a(n) = (2^(n+4)+1)*(2^n+1).at n=6A165222
• a(n) = A275706(n)^2 + A276688(n)^2 = [n]_{1+i}! * [n]_{1-i}!, where [n]_q! is the q-factorial, i = sqrt(-1).at n=5A276755
• a(n) = Product_{k=1..n} (2*k*(k-1)+1).at n=4A277347
• Number of nX6 0..1 arrays with every element equal to 0, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=7A297941