31700

Appears in sequences

• a(n) = ceiling(10000*log_2(n)).at n=8A004270
• Nearest integer to the space diagonal of the smallest (measured by the longest edge) primitive (gcd(a,b,c)=1) Euler bricks (a, b, c, sqrt(a^2 + b^2), sqrt(b^2 + c^2), sqrt(a^2 + c^2) are integers). If the space diagonal is an integer then the Euler brick is called a "perfect cuboid". There are no known perfect cuboids.at n=34A141029
• Number of nX3 0..1 arrays with no element equal to more than three of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=6A281029
• Number of nX7 0..1 arrays with no element equal to more than three of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=2A281033
• T(n,k)=Number of nXk 0..1 arrays with no element equal to more than three of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=38A281034
• T(n,k)=Number of nXk 0..1 arrays with no element equal to more than three of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=42A281034
• Numbers k such that Bernoulli number B_{k} has denominator 33330.at n=8A295589
• Consider all the Pythagorean triangles with perimeter A010814(n). Then a(n) is the sum of the areas of the squares on all of their sides.at n=34A334808